<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: chrka</title><link>https://news.ycombinator.com/user?id=chrka</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 13 Jun 2026 08:49:22 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=chrka" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by chrka in "Branchless Quicksort faster than std:sort and pdqsort with C and C++ API"]]></title><description><![CDATA[
<p>Normally, quicksort works best on random data. But with 90% already sorted and 10% random, it actually becomes harder to pick a good pivot. Sometimes the pivot ends up too large, which creates very uneven splits. When that happens, the algorithm switches to heapsort to avoid worst-case behavior, but heapsort is slower. Now, instead of immediately switching, it tries to partition again. Only if it’s still bad does it fall back to heapsort. That’s why performance improves.</p>
]]></description><pubDate>Sun, 07 Jun 2026 06:44:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=48432482</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=48432482</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48432482</guid></item><item><title><![CDATA[New comment by chrka in "Branchless Quicksort faster than std:sort and pdqsort with C and C++ API"]]></title><description><![CDATA[
<p>As for your party trick: The performance drop in "blqs" occurred because heapsort was applied directly to a poorly partitioned input. Quicksort now gets a second chance in this case. With 10% random, 90% sorted, the performance drop no longer occurs. It is now faster than std::sort.</p>
]]></description><pubDate>Sat, 06 Jun 2026 16:58:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=48426794</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=48426794</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48426794</guid></item><item><title><![CDATA[New comment by chrka in "Branchless Quicksort faster than std:sort and pdqsort with C and C++ API"]]></title><description><![CDATA[
<p>You will now see the directory listing. This website was actually created for my primary side project:
a simplified programming language for beginners. I just added a blog folder there for other things as well.</p>
]]></description><pubDate>Fri, 05 Jun 2026 11:40:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=48411060</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=48411060</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48411060</guid></item><item><title><![CDATA[New comment by chrka in "Branchless Quicksort faster than std:sort and pdqsort with C and C++ API"]]></title><description><![CDATA[
<p>Branchful only wins via ILP when data becomes good predictable. But since Quicksort partitioning aims for a 50/50 split, it operates in the worst possible zone for a branch predictor. That's why branchless wins here, as proven by the benchmarks.</p>
]]></description><pubDate>Fri, 05 Jun 2026 07:49:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=48409365</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=48409365</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48409365</guid></item><item><title><![CDATA[New comment by chrka in "Branchless Quicksort faster than std:sort and pdqsort with C and C++ API"]]></title><description><![CDATA[
<p>Author here. No, it's also called from the non_trivially_copyable branch (as a fallback). I'll fix that.</p>
]]></description><pubDate>Fri, 05 Jun 2026 07:18:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=48409125</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=48409125</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48409125</guid></item><item><title><![CDATA[Show HN: Faster than std:sort and pdqsort]]></title><description><![CDATA[
<p>Article URL: <a href="https://easylang.online/blog/blqsort">https://easylang.online/blog/blqsort</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48206632">https://news.ycombinator.com/item?id=48206632</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 20 May 2026 12:30:00 +0000</pubDate><link>https://easylang.online/blog/blqsort</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=48206632</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48206632</guid></item><item><title><![CDATA[Show HN: Branchless Quicksort – faster than std:sort and pdqsort]]></title><description><![CDATA[
<p>Article URL: <a href="https://easylang.online/blog/qsort">https://easylang.online/blog/qsort</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48107309">https://news.ycombinator.com/item?id=48107309</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 12 May 2026 12:30:37 +0000</pubDate><link>https://easylang.online/blog/qsort</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=48107309</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48107309</guid></item><item><title><![CDATA[Show HN: Avoiding "if" makes Quicksort faster]]></title><description><![CDATA[
<p>Article URL: <a href="https://easylang.online/blog/qsort">https://easylang.online/blog/qsort</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48049457">https://news.ycombinator.com/item?id=48049457</a></p>
<p>Points: 3</p>
<p># Comments: 4</p>
]]></description><pubDate>Thu, 07 May 2026 13:51:05 +0000</pubDate><link>https://easylang.online/blog/qsort</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=48049457</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48049457</guid></item><item><title><![CDATA[When 'if' slows you down, avoid it]]></title><description><![CDATA[
<p>Article URL: <a href="https://easylang.online/blog/branchless">https://easylang.online/blog/branchless</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48035568">https://news.ycombinator.com/item?id=48035568</a></p>
<p>Points: 6</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 06 May 2026 12:44:24 +0000</pubDate><link>https://easylang.online/blog/branchless</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=48035568</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48035568</guid></item><item><title><![CDATA[Show HN: A Fast Quicksort in C with Branch‑Avoidant Coding and Threads]]></title><description><![CDATA[
<p>Article URL: <a href="https://easylang.online/blog/threaded_sorting">https://easylang.online/blog/threaded_sorting</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47947658">https://news.ycombinator.com/item?id=47947658</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 29 Apr 2026 12:54:14 +0000</pubDate><link>https://easylang.online/blog/threaded_sorting</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=47947658</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47947658</guid></item><item><title><![CDATA[Show HN: Interactive demos of sorting algorithms with runtime comparisons]]></title><description><![CDATA[
<p>Article URL: <a href="https://easylang.online/sorting">https://easylang.online/sorting</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47806490">https://news.ycombinator.com/item?id=47806490</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 17 Apr 2026 14:42:28 +0000</pubDate><link>https://easylang.online/sorting</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=47806490</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47806490</guid></item><item><title><![CDATA[Show HN: Interactive sorting algorithm visualizations with runtime comparisons]]></title><description><![CDATA[
<p>Article URL: <a href="https://easylang.online/sorting">https://easylang.online/sorting</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47780013">https://news.ycombinator.com/item?id=47780013</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 15 Apr 2026 14:58:29 +0000</pubDate><link>https://easylang.online/sorting</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=47780013</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47780013</guid></item><item><title><![CDATA[Show HN: Law of Large Numbers or Why It's a Bad Idea to Go to a Casino]]></title><description><![CDATA[
<p>Article URL: <a href="https://easylang.online/mcarlo.html">https://easylang.online/mcarlo.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46478500">https://news.ycombinator.com/item?id=46478500</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Sat, 03 Jan 2026 16:30:28 +0000</pubDate><link>https://easylang.online/mcarlo.html</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=46478500</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46478500</guid></item><item><title><![CDATA[New comment by chrka in "Tell HN: Merry Christmas"]]></title><description><![CDATA[
<p><a href="https://easylang.online/xmas.html" rel="nofollow">https://easylang.online/xmas.html</a></p>
]]></description><pubDate>Thu, 25 Dec 2025 07:34:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=46382837</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=46382837</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46382837</guid></item><item><title><![CDATA[Show HN: Programming a Christmas Tree]]></title><description><![CDATA[
<p>Article URL: <a href="https://easylang.online/xmas.html">https://easylang.online/xmas.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46355648">https://news.ycombinator.com/item?id=46355648</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 22 Dec 2025 16:40:03 +0000</pubDate><link>https://easylang.online/xmas.html</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=46355648</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46355648</guid></item><item><title><![CDATA[Show HN: A short story of my programming language Easylang]]></title><description><![CDATA[
<p>Article URL: <a href="https://easylang.online/story.html">https://easylang.online/story.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46015485">https://news.ycombinator.com/item?id=46015485</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 22 Nov 2025 15:30:16 +0000</pubDate><link>https://easylang.online/story.html</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=46015485</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46015485</guid></item><item><title><![CDATA[Analysis indicates that the universe’s expansion is not accelerating]]></title><description><![CDATA[
<p>Article URL: <a href="https://ras.ac.uk/news-and-press/research-highlights/universes-expansion-now-slowing-not-speeding">https://ras.ac.uk/news-and-press/research-highlights/universes-expansion-now-slowing-not-speeding</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45840200">https://news.ycombinator.com/item?id=45840200</a></p>
<p>Points: 261</p>
<p># Comments: 208</p>
]]></description><pubDate>Thu, 06 Nov 2025 20:45:39 +0000</pubDate><link>https://ras.ac.uk/news-and-press/research-highlights/universes-expansion-now-slowing-not-speeding</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=45840200</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45840200</guid></item><item><title><![CDATA[Show HN: Strange Attractors – Visualized with Easylang]]></title><description><![CDATA[
<p>This post about strange attractors isn't as cool as this recent one: <a href="https://news.ycombinator.com/item?id=45777810">https://news.ycombinator.com/item?id=45777810</a>. My visualization runs with my programming language, which is interpreted by WASM code and uses JS and Canvas – without WebGL.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45823178">https://news.ycombinator.com/item?id=45823178</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 05 Nov 2025 14:25:14 +0000</pubDate><link>https://easylang.online/apps/attractors.html?hn2511</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=45823178</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45823178</guid></item><item><title><![CDATA[Show HN: A beginner-programming language and IDE with helpful tab completion]]></title><description><![CDATA[
<p>This programming language, along with its IDE and tutorials, has been around for some time, but the TAB completion, which is helpful especially for beginners, is new.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45800962">https://news.ycombinator.com/item?id=45800962</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 03 Nov 2025 16:36:12 +0000</pubDate><link>https://easylang.online/ide/</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=45800962</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45800962</guid></item><item><title><![CDATA[Splitting (Empty) Strings (2017)]]></title><description><![CDATA[
<p>Article URL: <a href="https://chriszetter.com/blog/2017/10/29/splitting-strings/">https://chriszetter.com/blog/2017/10/29/splitting-strings/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45731957">https://news.ycombinator.com/item?id=45731957</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 28 Oct 2025 12:29:33 +0000</pubDate><link>https://chriszetter.com/blog/2017/10/29/splitting-strings/</link><dc:creator>chrka</dc:creator><comments>https://news.ycombinator.com/item?id=45731957</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45731957</guid></item></channel></rss>