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

After one pass of the Quick Sort we know that: O the largest value is in its correct location. O the smallest value is in its correct location. O the values in the array are pairwise sorted. O the splitVal is in its correct location. O None of these is correct.

Write a function named merge-sort in Scheme that takes a list of integers as input and returns a sorted list. (Hint: Use the merge and split-list methods that you just wrote. You will have to cut-and-paste the code into your answer.) For example, (merge-sort '(5 3 1 2 4)) should return '(1 2 3 4 5) • (every-other '()) should return '()

Computer Science Using Java, write a simple Insertion Sort program that can read in integers from a text file (line by line) and sort them into another text file. Use inFile and outFile for the input and output files, respectively. Also make sure that the algorithm keeps track of the comparisons and exchanges performed by the sort so that they may be printed out in the console after the sort is completed

The algorithm: –In an array of n elements, go to index [n/2] –If the record there is the one you want, you are done –If the record value there is smaller than your search value, all records less than the current record can be ignored – set your search range of elements to [n/2+1…n] and return to step 1 –Otherwise, set your range of elements to [0…(n/2)-1] and return to step 1 –Repeat this loop until you have 0 elements (record is not found) or record is found Short answer Another approach to the update algorithm is to perform use the delete function for the old value and if it is successful, call the insert function using the new value. Explain in your own words if you think this approach is significantly better, worse, or in the same category as the algorithm discussed in the slides, and why.

For the list shown below, demonstrate the following sort: 10, 1, 5, 2, 6, 8, 4, 10, 6, 6, 2, 4, 1, 8, 7, 3 External sort. Use a run size of 4. Note: continue until the final list is sorted!

Using python and sys.argv Create a program called randdf.py that has a function that takes two integer arguments and prints a Pandas dataframe.  The two arguments will correspond to the number of rows and number of columns, respectively.  The dataframe should be filled with random integers from 0 to 100.  Set your random seed to 56.  Note: Use random from numpy. Otherwise, you might get a different result.

The PARTITION(A) procedure inputs an array A, and takes the fınal element x = A[r] as the pivot element. The output is an array where all elements to the left of x are less than x, and all elements to the right of x are greater than x. An example is provided on pg. 172 of the textbook. In this example, A = [2,8,7,1,3,5,6,4]. The pivot element is x=4 (highlighted in red). The end result of PARTITION is [2,1,3,4,7,5,6,8]. Notice that all elements to the left of 4 are less than 4, and all elements to the right of 4 are greater than 4. I strongly encourage you to go through this example, step by step. Let A = [1,2,7,8,9,6,3,4,5]. Determine PARTITION(A).

You have a long thin data set (THIN) created by running the following DATA step. You want a wide data set as shown in the folowing listing. Using arrays, write a program to do this (SAS). Data THIN; Input ID $ Time X @@; Datalines; 001 1 10 001 2 12 001 3 15 004 1 17 003 1 14 003 2 18 003 3 22 003 4 28 002 1 18 004 2 28 ;

Write a program that will load 100 integers into array X. Separate the even from the ode valued elements. The procedure should place the even values in ascending order startin- from the first location of the original array and place the odd values in ascending orde starting from the last position of the original array.