Quicksort
This is a quicksort implementation https://algs4.cs.princeton.edu/23quicksort/ that takes the median value of three random index points in the collection and used that value for the initial pivot value to help avoid worst case scenarios.
This is a quicksort implementation https://algs4.cs.princeton.edu/23quicksort/ that takes the median value of three random index points in the collection and used that value for the initial pivot value to help avoid worst case scenarios.