Conversation

Java Quicksort uses insertion sort when n < 47. "

: 'Fancy algorithms are slow when n is small, and n is usually small.' -- Rob Pike"

6

68

25

Peter Geoghegan

@petervgeoghegan

Replying to

That's a very common optimisation. Most (all?) practical C stdlib quicksorts do much the same thing.

11:44 AM · Jan 17, 2013Twitter Web Client

Replying to

@petervgeoghegan

Yep, Sedgewick recommended insertion sort in '78: dl.acm.org/citation.cfm?d