In the linear time selection algorithm which finds the ith smallest element in O(n) time our first step is to divide our unordered set into subsets of 5. Why is the size of the subsets chosen to be 5 and how would the algorithm be affected if I chose a different number. Nothing online describes why this number is the chosen subset size..
Asked
Active
Viewed 575 times
