QuickSort conclusion (Off-Topic)
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:
- QuickSort conclusions -
marmot 1333,
2013-10-23, 08:58
- It's like he's trying to tell me something! - Oholiab, 2013-10-23, 12:06
- QuickSort conclusions - GrizzNKev, 2013-10-23, 13:18
- QuickSort conclusions -
Samusaaron3,
2013-10-23, 13:31
- QuickSort conclusions -
marmot 1333,
2013-10-23, 14:27
- QuickSort conclusion - Samusaaron3, 2013-10-23, 16:04
- QuickSort conclusions -
marmot 1333,
2013-10-23, 14:27
- I Vaguely Remember Doing This -
Blackt1g3r,
2013-10-23, 14:23
- Yah, just use the libraries... - RC, 2013-10-23, 16:18
- I Vaguely Remember Doing This -
Schooly D,
2013-10-26, 08:52
- Agreed - kidtsunami, 2013-10-26, 11:18