[Comment removed by author]
The described algorithm is definitely not algorithm R.
I would wager most programmers would use algo R. Actually, they’d pick that after a naive shuffle. I think that’s entirely consistent with the point that people think they know how to solve the problem, but they don’t (know the best way).
The authors claim of 0% may be hyperbole, but even taken literally I think the true familiarity is closer to 0 than 51.
It’s like a post about quick sort and then you say “good ol' bubble sort.”
I’m sorry, what do you mean by O(k<n)?
The algorithm in the blog post isn’t algorithm Z either. It’s Method D from a different paper by Vitter.
This post don’t describe the algorithm in some kind of pseudocode or similar (maybe I missed something)