Quicksort has several optimization strategies that we discussed in class. Select a valid one from the list below. (could be more than one) Always divide the input exactly in half in the first step, then adjust afterwards. Use recursion for larger files of similar data ranges. Use merge sort for sub-partitions. Use insertion sort for small partitions.

Given this array containing characters: Data M B A L J Z K C Ꭰ X Index 0 1 2 3 4 5 6 7 8 9 What does the list look like after one full run of the quick sort partitioning method, where the pivot is the low index value? Enter your answer with a space between each character, without commas. A

Implement external sort: for sort phase use normal sort,   for merge phase use two way merge to merge n sorted files (merge2way(n)), for array sort use heapsort. Also write merge(f1, f2, f3) to merge two sorted files f1 and f2 into f3.. Write mergenway(n) method and print execution time of both merges for initial input file over 10MB data. A sample input is as follow:Note:First input is max array size for sort           10   84   82   52   80   96   85   75   75   82   87  92   89   57   94   93   92   63   99   87  72   73   56   74   50   84   62   72   55   86   75  74  100   83   60   53   68   89   67  66  65   72   94   73   54   98   96   85   75   75   82   87  92   89

Using Java, 1. Implement external sort: for sort phase use normal sort,   for merge phase use two way merge to merge n sorted files (merge2way(n)), for array sort use heapsort. Also write merge(f1, f2, f3) to merge two sorted files f1 and f2 into f3.. Write mergenway(n) method and print execution time of both merges for initial input file over 10MB data.  A sample input is as follow:Note:Fist input is max array size for sort           10   84   82   52   80   96   85   75   75   82   87  92   89   57   94   93   92   63   99   87  72   73   56   74   50   84   62   72   55   86   75  74  100   83   60   53   68   89   67  66  65   72   94   73   54   98   96   85   75   75   82   87  92   89

Write down the quick sort algorithm in python. Consider one random example and execute the code.   The random example should also be provided before the code which is used to execute the code.   Code with comments and output screenshot ( no copy paste please)

in java

A. Can you draw the animation of Merge sort: given an unsorted array of size 10, show the divide andconquer techniqueb. What is Running time for Merge Sort: O(nlogn) such that n is the size of thearray: Reference code attached

Here is the iterative implementation of binary search: For each call to binary_search below, indicate how many times the code inside the while loop will execute.  animals = ["aardvark", "cat", "dog", "elephant", "panda"] 1. binary_search("elephant", animals)                                                                                           2. binary_search("dog", animals)                                                                                           3. binary_search("anteater", animals)

Suppose we should write a program to sort in place, using no more than a constant amount of storage space in addition to the original array. What sorting algorithms should we avoid? a. Counting sort b. Radix sort c. Bucket sort d. Merge sort e. All of the other answers