Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
s-phi-nl
on Aug 28, 2017
|
parent
|
context
|
favorite
| on:
Bubble Sort: An Archaeological Algorithmic Analysi...
Anecdotally, the professor of my algorithms class had us all sort cards manually and asked us to describe the algorithm we used when we began studying sorting algorithms. Most of us used either selection sort or insertion sort.
thethirdone
on Aug 28, 2017
[–]
I would think bucket sort (into the suits) would be the most common. Whenever I am sorting named papers I always do it with 26 piles.
Retric
on Aug 28, 2017
|
parent
[–]
A-K in 13 piles then suits in 4 piles is a little faster. Or if your space limited you can group A-7 then 8-K.
vanderZwan
on Aug 28, 2017
|
root
|
parent
[–]
That's more or less radix sort, no?
Retric
on Aug 28, 2017
|
root
|
parent
[–]
Yep, though radix and bucket sorts are closely related.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: