QuickSort conclusion (Off-Topic)

by Samusaaron3, Bay Area, Wednesday, October 23, 2013, 16:04 (3832 days ago) @ marmot 1333
edited by Samusaaron3, Wednesday, October 23, 2013, 16:12

Three randoms should work well. If you want to go all out, you could also implement switching to insertion sort once you're dealing with small arrays (around size 10 or so).

You can read up on it here: http://algs4.cs.princeton.edu/23quicksort/

Let me know if the median pivot works well!


Complete thread:

 RSS Feed of thread