Tukey proposed an idea to find a better median in random arrats so that quick sort uses less comparisons to get approximate median of 9 items in the arrays. This assignment to test if a quick sort backed by "Tukey's ninther's idea" is faster than regular quick sort algorithm. You need to compare these two approaches in the sorting of randomly created same 32K char items in arrays. Repeat the comparison 300 times keeping running time of each approach. In your analysis, report
- Average running time of Tukey's approach and Regular QSort.
- Standard deviation of running time of Tukey's approach and Regular QSort.
- How many time Tukey's approach is faster than regular QSort.
- Is Tukey's idea significantly faster than regular quick sort? What is p-value? (Assuming run times are normally distributed, use t-test to compare their normal distributions. Please see [login to view URL] )
Submit a .cpp file with your code. On the top of you cpp file, report above metrics as comments.
9 freelanceria on tarjonnut keskimäärin 39$ tähän työhön
i have strong background with datastructures, and i have done some quick research on this Tukey's idea, i can do it for you. pleas message if interested. Regards
Hello. How are you. I'm software engineer and algorithm expert. I have many experiences in c, c++, c#, java, python, node.js. I can complete your project successfully. Thanks.
I would like to take up this project as I have knowledge in C++, C and java. Also I have knowledge in probability and random process. Looking forward to work on this project