Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
chrka
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
chrka
7d ago
Something that came up a bit too briefly in the post: acknowledgement is a major motivation for making software open source. AI can absorb your open-source project on GitHub, convert it to Rust, make some changes, and spit it out as its own
2.
▲
by
chrka
13d ago
I'm currently working on the browser editor for my programming language, With the smart tab completion - which parses the entire program up to the cursor every time you press tab - you can avoid a bunch of typing and also potential err
3.
▲
by
chrka
2mo ago
They say they don't do that. But maybe I should be more skeptical.
4.
▲
by
chrka
2mo ago
That's exactly why my previous public GitHub repo is now private.
5.
▲
by
chrka
2mo ago
I've written something like this in C - including resulting assembler code for ARM and x86. https://easylang.online/blog/branchless
6.
▲
by
chrka
2mo ago
https://news.ycombinator.com/item?id=48035568
7.
▲
by
chrka
2mo ago
Exactly. Just like using LibGen is prohibited.
8.
▲
by
chrka
2mo ago
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, and I received credit for it. But LLMs just hoover up everyth
9.
▲
by
chrka
3mo ago
Therefore it is srand(1).
10.
▲
by
chrka
3mo ago
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 been mostly a waste of time in this case. The algorithm an
11.
▲
by
chrka
3mo ago
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 change in the source code caused Clang to generate dif
12.
▲
Your code is fast if you're lucky
(tiki.li)
136 points
by
chrka
3mo ago
|
85 comments
13.
▲
by
chrka
3mo ago
Don't trust your compiler. Your code is only fast if you're lucky. https://tiki.li/blog/lucky_code.html
14.
▲
Your code is fast – if you're lucky
(tiki.li)
2 points
by
chrka
3mo ago
|
0 comments
15.
▲
by
chrka
4mo ago
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 algo
16.
▲
by
chrka
4mo ago
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 dr
17.
▲
by
chrka
4mo ago
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.
18.
▲
by
chrka
4mo ago
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
19.
▲
by
chrka
4mo ago
Author here. No, it's also called from the non_trivially_copyable branch (as a fallback). I'll fix that.
20.
▲
Show HN: Faster than std:sort and pdqsort
(easylang.online)
1 points
by
chrka
4mo ago
|
0 comments
21.
▲
Show HN: Branchless Quicksort – faster than std:sort and pdqsort
(easylang.online)
2 points
by
chrka
5mo ago
|
0 comments
22.
▲
Show HN: Avoiding "if" makes Quicksort faster
(easylang.online)
3 points
by
chrka
5mo ago
|
4 comments
23.
▲
When 'if' slows you down, avoid it
(easylang.online)
6 points
by
chrka
5mo ago
|
0 comments
24.
▲
Show HN: A Fast Quicksort in C with Branch‑Avoidant Coding and Threads
(easylang.online)
1 points
by
chrka
5mo ago
|
0 comments
25.
▲
Show HN: Interactive demos of sorting algorithms with runtime comparisons
(easylang.online)
1 points
by
chrka
5mo ago
|
0 comments
26.
▲
Show HN: Interactive sorting algorithm visualizations with runtime comparisons
(easylang.online)
1 points
by
chrka
6mo ago
|
0 comments
27.
▲
Show HN: Law of Large Numbers or Why It's a Bad Idea to Go to a Casino
(easylang.online)
3 points
by
chrka
9mo ago
|
1 comments
28.
▲
by
chrka
9mo ago
https://easylang.online/xmas.html
29.
▲
Show HN: Programming a Christmas Tree
(easylang.online)
2 points
by
chrka
9mo ago
|
0 comments
30.
▲
Show HN: A short story of my programming language Easylang
(easylang.online)
2 points
by
chrka
10mo ago
|
0 comments
More ›