Mike McFadden

> first download the contents of owr.js from within the application and inject it to the WKWebView (instead of doing it in JavaScript). That results in the following: > WebSocket...

I agree, right now the value is hard-coded.

I implemented the algorithm described in "Ratio based stable in-place merging", by Pok-Son Kim and Arne Kutzner, and then I went back and wrote a much simpler version and got...

I'll be sure to check it out! The difference you're describing is known as the _movement imitation buffer_ – this paper recommended using that too, but I found tagging to...

On the first run your algorithm was 20% faster than WikiSort when I removed the cache, so you've got my attention! What else is it doing differently? Structurally it looks...

I like the idea of only pulling out the internal buffer one time at the very start and using MergeInPlace to redistribute it – I had tried doing that on...

(It ended up being called "Block merge sort" because I thought Dr. Kutzner was the first to create a practical algorithm and allowed him to name it, then I decided...

Awesome! Minor correction, though: I think it's actually .3x faster, or 30%. 1x faster means twice as fast. The test you used seems closest to RandomFew, which was only 20%...

Alright, I'm looking into the Pardo/Huang algorithm now. It looks like the block rearranging step is actually completely different than the one WikiSort uses. WikiSort rolls the A blocks through...

Yeah, I was having trouble trying to figure out how Huang's and Langston's paper was supposed to work in all cases – they just kind of gloss over the details...