IN C/C++

Program operation Please turn on tail recursion optimization in compile.

If you are using Code :: Block, go to setting >> compiler >> compiler settings and optimize -O2 -O3 -Os

Hook up

If you are using linux or cmd, use g ++ -O2 -O3 -Os

In readme file , please explain that after turning on tail recursion optimization, what is the difference in time between recurse smaller sublist and recurse longer sublist, and why there is such a difference

Quicksort analysis Choosing a good pivot has a significant impact on the performance of quicksort. When selecting the pivot, there are two options: leftmost and median of three. And after swapping the position of the pivot, there are three options for the order of recursion. Recurse longer sublist first then recurse shorter sublist, or recurse shorter sublist then recurse longer sublist, or recuse the left sublist then recurse the right sublist (like text book p341 program 7.6). In your readme you should show the time for six different combinations of following table (by capturing your program execution time) Ex: C:\Users\ HSNL\Desktop\ds\ttt.exe use leftmost and longer fist execution time = 3.068000 Process returned 0 (0x0) execution time : 3.097 si Press any key to continue. If you don't know how to get your program execution time you can follow the program below #include // variable to store your time clock_t start, end; double cpu_time_used; Il calculate start time start = clock(); /* your quicksort algorithm put in here*/ end = clock(); // calculate total cost time cpu_time_used = (double) (end - start)) / CLOCKS_PER_SEC; printf("use leftmost and longer fist execution time = %f ", cpu_time_used); leftmost median of three. Longer fisrt Time=? Time=? Shorter first Time=? Time=? original Time=? Time=? Input. Test data is in the attachment You must sort the test data using the 6 methods mentioned above and analyze the time Output: Make sure your readme has screenshots of individual execution times for these 6 methods And analyze why there is such a result void quick Sort le 1/* sort a[left:ric Sok Sort (element all, int left, int right) alleft:right] into nondecreasing order the key field; a[left].key is arbitrarily whosen as the pivot key; it is assumed that alleft].key pivot); if (i