barrett/barrettruth.com
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

feat(posts): remove folds

Browse source
This commit is contained in:
Barrett Ruth 2024-11-29 19:38:44 -06:00
parent 0e6cc1de7a
commit ed0c3b7ab2
8 changed files with 49 additions and 111 deletions
Download patch file Download diff file Expand all files Collapse all files

10
posts/algorithms/extrema-circular-buffer.html
View file

@ -157,9 +157,7 @@ private:
size_t capacity;
};</code></pre>
</div>
<div class="fold">
<h3>optimizing the approach</h3>
</div>
<h3>optimizing the approach</h3>
<div class="problem-content">
<p>
Rather than bear the brunt of the work finding extrema in calls to
@ -246,9 +244,7 @@ private:
size_t capacity;
};</code></pre>
</div>
<div class="fold">
<h3>monotonic <s>queues</s> deques</h3>
</div>
<h3>monotonic <s>queues</s> deques</h3>
<div class="problem-content">
<p>
Thinking a bit deeper about the problem constraints, it is clear
@ -370,7 +366,7 @@ private:
std::deque&lt;std::pair&lt;double, size_t&gt;&gt; maxs;
size_t capacity;
};</code></pre>
<div class="fold"><h3>further improvements</h3></div>
<h3>further improvements</h3>
<ol>
<li>
While the final approach is <i>theoretically</i> faster than the