scandum

7 ms·

1.
by scandum 2y ago
For all practical matters it is xterm that has become the standard. Like with web browsers, it is irrelevant what the standard states. The only thing that matters is that it displays correctly with the most popular / authoritative brow
2.
by scandum 3y ago
Web pages are increasingly bulky. A 3 MB page will take 1 second to load at 25 Mbps, so latency is often not the primary bottleneck. Part of the problem may be that companies who own network infrastructure, and get paid for data usage, are
3.
Show HN: Wolfsort v3 – A fast hybrid Stalin sort(github.com)
1 points by scandum 3y ago|0 comments
4.
by scandum 3y ago
Even if it's a thing, the idea that a teacher should take on the role of psychologists and figure out a child's optimal learning style should be preposterous to anyone with common sense. It might work in combination with a softwar
5.
by scandum 3y ago
I think you pointed out the problem. I suspect it has the same problem as ncurses: Not easy to learn, get proficient with, or rapidly produce something decent with. I've been working on a project for a while that allows running any con
6.
by scandum 3y ago
Seems like speculation on top of speculation on top of speculation. I wonder what the archeological data looks like, 6 burned down houses and a very active imagination?
7.
by scandum 3y ago
Isn't the problem the absence of random DNA? I wouldn't call random data 'complex', but it is easy to sequence when assembling short reads.
8.
by scandum 3y ago
My main take away from the article was that we, apparently, need a time traveler to confirm/disprove Einstein's theory.
9.
by scandum 3y ago
There's likely a market for office workers since there's a significant reduction of stress on the eyes. You'd save about 0.5 kwh a day in electricity, more if the AC is running. So I could see them becoming popular once the p
10.
by scandum 3y ago
MUDs are easily hosted abroad. Problem solved. This reminds me of UK's 90% tax rate, which caused many multi-millionaires to leave the country.
11.
by scandum 3y ago
I get the current time in microseconds, and increment by one nanosecond for each call between updates. Problem solved for the next 200 years.
12.
by scandum 3y ago
> the coulombic efficiency of SSAB-PDBM was 84% at 4 C rate, which gradually decreased to 66% at 101 C rate. Lithium batteries are over 95% efficient, so a long way indeed. Since the battery contains water, I assume it doesn't work
13.
by scandum 3y ago
quadsort/fluxsort/crumsort author here. For me there's a strong visual component, perhaps most obvious for my work on array rotation algorithms. https://github.com/scandum/rotate There's also the ab
14.
by scandum 3y ago
https://github.com/scandum/quadsort/blob/f171a0b26cf6bd6f6dc... As you can see, quadsort 1.1.4.1 used 2 instead of 4 writes in the bi-directional parity merges. This was in June 2021, and would have compiled
15.
by scandum 3y ago
"pick a few fixed sizes and handle the rest by rounding down then a few steps of insertion sorting." I'm late to the party, but this sounds a lot like quadsort's small array handling: Sort 4, 8, or 16 elements using unro
16.
by scandum 4y ago
The gif is indeed a bit rushed, I'll see if I can get it looking a bit better soon-ish. The video is up on YouTube where it can be paused. Edit: Just now seeing you asked about updates. I added support for clang's branchless terna
17.
by scandum 4y ago
There's a list of online MUDs that are still in active development here: https://mudhalla.net/mudlist/ Especially on Windows you'd be better off using PuTTY or TinTin++ to connect, since Microsoft's teln
18.
Show HN: Fluxsort, a stable Quicksort, faster and more adaptive than Timsort(github.com)
4 points by scandum 4y ago|2 comments
19.
by scandum 4y ago
It is said that getting ripped off is the highest form of flattery. The FOSDEM talk indeed addressed my worries. I actually don't see the ping-pong merge as a personal accomplishment, it's not that novel a concept, at best I popul
20.
by scandum 4y ago
I've been most impressed with ChatGPT's ability to analyze source code. It may be able to tell you what a compiled binary does, find flaws in source code, etc. Of course it would be quite idiotic in many respects. It also appears
21.
by scandum 4y ago
As I wrote previously, thank you for fully addressing all my concerns in your recent FOSDEM presentation. While it would have been outside the scope of the presentation, and time being short, quadsort does present an interesting alternative
22.
by scandum 4y ago
I've just watched your FOSDEM presentation and to put it simply, thank you for addressing all the issues I had. I felt pretty uneasy about what I perceived as a situation where you could end up taking full credit for innovations I was
23.
by scandum 4y ago
That code was indeed a bit unorganized, I updated bench.c in wolfsort's github, hopefully that'll fix it. Would you mind giving your 2 cents on this topic? https://news.ycombinator.com/item?id=34650406 You are pro
24.
by scandum 4y ago
This is what quadsort's README stated in early 2021: "Since the parity merge can be unrolled it's very suitable for branchless optimizations to speed up the sorting of random data. Another advantage is that two separate memor
25.
by scandum 4y ago
Those are some awfully large array sizes. Not something I ever had the patience for to sit out, or optimize for, as it didn't seem like the most common real-world scenario. One thing glidesort appears to do extremely well is to branchl
26.
by scandum 4y ago
If the last presentation's benchmark still goes, blitsort is significantly faster. Keep in mind that glidesort is partly derived from fluxsort and many of its techniques were directly inspired by fluxsort/quadsort, while several o
27.
by scandum 4y ago
I went ahead and updated bench.c for the wolfsort github.
28.
by scandum 4y ago
I'm planning to update wolfsort soon-ish. I did some work on a dropsort hybrid, like rhsort, though it's slower overall because I'm not quite brave enough to match the level of insanity (I mean this in a good way) that rhsort
29.
by scandum 4y ago
I recently upgraded fluxsort, you might want to give v1.1.5.4 a spin. I also updated the benchmark to use actual natural runs and be less favorable to rhsort, sorry. ;-) I'm not surprised fluxsort is slightly faster, it's heavily
30.
by scandum 4y ago
The latest quadsort version sorts 8 elements at a time. It's not really a sorting network, and it wouldn't have worked very well prior to branch prediction, or having a multitude of registers. So basically all the work that had be

More ›