Week 9 Quick Sort Recursion Limits Analysis

Recursion Limits on quickSort
I provided a static mutator FHsort.setRecursionLimit(int) that you can use to change this limit to any int value in the range of 2 to 1000. I want you to do this to find the optimal recursion limit arrays of various sizes.
Client Requirements
Investigate all recursion limits from 2 to 300 in steps of 2: 2, 4, 6, 8 “¦
Run them on different size arrays from 20,000 up to the largest you can get in your computer (you should be able to get it up to close to 1 million or more).
Provide a table that summarizes the results – you don’t have to show every recursion limit value – if there is no change in 10 consecutive values, pick one to represent that value.
Comment on the results, describing the range that seems to be minimal (and flat)

“Place your order now for a similar assignment and have exceptional work written by our team of experts, guaranteeing you A results.”