Explain the difference between regular insertion sort and binary insertion sort. 4.  Shortly describe an algorithm to improve the performance of the merge sort by tweaking the partitioning in merge sort? 5.  How can use Dual Pivot in Quick sort to improve the performance of Single Pivot Quick sort?

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

Sort the following lists using the Bubble Sort algorithm provide Step-by-step answers? a) Original list: [5, 2, 8, 1,6] b) Original list: [8, 3, 1, 5, 4]

Alert dont submit AI generated answer.

thank u.

6. Consider the following code segment. def magic(li, key): for i in range(len(li)): if li[i] == key: return i return -1 Which algorithm is depicted above? (a) Linear search (b) Binary search (c) Selection sort (d) Insertion sort

def sorting(x, i, j) if j+1-i < 10 then  Mergesort(x, i, j); t1 = i + (j+1-i)/3 t2 = i + 2*(j+1-i)/3 Sorting(x, i, t2) Sorting(x, i, j) Sorting(x, i, t2) // x is an array, I and j are first and last indices of this part of the array // on k elements, takes O(k log k) time   worst case analysis?

The script has four steps: Read a list of integers (no duplicates). Output the numbers in the list. Perform an insertion sort on the list. Output the number of comparisons and swaps performed during the insertion sort. Steps 1 and 2 are provided in the script. Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort() to: Count the number of comparisons performed. Count the number of swaps performed. Output the list during each iteration of the outside loop. Implement step 4 at the end of the script. Hints: In order to count comparisons and swaps, modify the while loop in insertion_sort(). Use global variables for comparisons and swaps. The script includes three helper functions: read_nums() # Read and return a list of integers. print_nums(nums) # Output the numbers in nums swap(nums, n, m) # Exchange nums[n] and nums[m] Ex: When the input is: 3 2 1 5 9 8 the output is: 3 2 1 5 9 8 2 3 1 5 9 8 1 2 3 5 9 8 1 2 3 5 9 8 1 2 3 5 9 8 1 2 3 5 8 9…

3. Given the following list: 9 4 2 6 7 5 3 8 Identify the state of the list while being sorted using the selection sort algorithm.

How to solve this question