orangecrumbs
Loading the deck
Could not load the deck. Check the connection and reload.
Saved
orangecrumbs
Weekly Wikipedia digest

Get new Wikipedia articles popular on Hacker News - one email per week.

No spam. Unsubscribe anytime. · Privacy

You're on the list.A welcome note should arrive in a minute.Check Promotions or Spam if you do not see it.
Full article HN thread
Comb Sort - Just As Good As Quick Sort

Comb Sort - Just As Good As Quick Sort

▲ 31 💬 9

Comb sort is a relatively simple sorting algorithm originally designed by Włodzimierz Dobosiewicz and Artur Borowy in 1980, later rediscovered (and given the name "Combsort") by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort in the same way that…

No items match this view.
Try Shuffle or New.
HN ↗
Loading comments…
List Mode
Comb Sort - Just As Good As Quick Sort
Watch on YouTube

Comb Sort - Just As Good As Quick Sort

to move·?shortcuts
▲ 31💬 9

Comb sort is a relatively simple sorting algorithm originally designed by Włodzimierz Dobosiewicz and Artur Borowy in 1980, later rediscovered (and given the name "Combsort") by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort in the same way that…

Open on HN ↗
Loading comments…
Weekly Wikipedia digest

Get new Wikipedia articles popular on Hacker News - one email per week.

No spam. Unsubscribe anytime. · Privacy

You're on the list.A welcome note should arrive in a minute.Check Promotions or Spam if you do not see it.

Sort & filter

Sort
🔀 Shuffle
🕑 New
Upvotes
20+
50+
100+
200+
Type
All
Article
List