Viewing profile — chrka

They say they don't do that. But maybe I should be more skeptical.

That's exactly why my previous public GitHub repo is now private.

I've written something like this in C - including resulting assembler code for ARM and x86. https://easylang.online/blog/branchless

https://news.ycombinator.com/item?id=48035568

Exactly. Just like using LibGen is prohibited.

I also recently made an open-source project with 200 GitHub stars private. I never had a problem with others using it as the basis for their own projects. In fact, that happened, a…

Therefore it is srand(1).

Both versions use the same input data. I also tried different random initial values and got essentially the same result. I didn't test hundreds of inputs, since that would have bee…

You're talking about the complexity of the Quicksort algorithm, whereas the article is about code generation. Both versions sort the same data using the same algorithm. Just a tiny…

Don't trust your compiler. Your code is only fast if you're lucky. https://tiki.li/blog/lucky_code.html

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, w…

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 cas…

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 t…

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 predict…

Author here. No, it's also called from the non_trivially_copyable branch (as a fallback). I'll fix that.