Pick one of these following sorts and explain the steps: merge, insertion, selection.

What is the average-case running time for Merge Sort and Quick Sort, respectively? Why do we prefer Quick Sort algorithm in practice? Please  provide at least two benefits of Quick Sort and also provide explanations for each benefit (plain language explanation is fine).

Data structures. How to write modified merge sort on Java? Please help!

For the terminology stored in each cell of the table below, choose a corresponding key point from the Hints section below and put the number (not the text).  Some choices may be used multiple times or not at all. Dictionary(map) ADT: Quicksort: Mergesort: Radix sort over big integer numbers: Insertion sort: Selection sort: Heapsort: Counting sort over a small range of integers: Bucket sort: Bubble sort: Depth-First-Search: Bellman-Ford’s algorithm: Prim’s algorithm: Dijkstra’s algorithm: 0-1 knapsack problem: Hints : sorting: continuously swapping elements while finding the next number to add in the sorted sublist sorting: an improved selection sort - extracting the root of a binary tree to get the maximal/minimal key sorting: removing one element from the input data, then finding the location it belongs within the sorted sublist, and inserts it there sorting: in general, sorting the least significant position first sorting: finding  the smallest element in the…

The data is known as follows (n = 10): 9, 79, 75, 59, 30, 96, 82, 23, 94, 72 Write down a step by step of data sequence to be ordered in ascending order and count the number of comparison operations performed using Merge Sort Algorithm?

Sort the same list of numbers using the merge sort: (no code, just handwritten showing of sorted steps)13 9 5 7 12 2 3 14 6 1

Quicksort Merge sort Radix sort

Describe the procedure of sorting for each sorting algorithm for the following records: 5 20 4 13 9 2 18 a. Selection sort b. Insert sort C. Merge sort

4- Sort the list A[]={ 20, 13,4, 34, 5, 15, 90, 100, 75, 102, 112, 1} a) Using Merge Sort and show the order that the Merge procedure is performed. b) Explain the average case of Merge Sort. Give a detail explanation of how we can estimate the mean in relationship with the worst and best-case scenarios (hint: use the answer for question 3 as a lower-bound for the average).

When should a sequential search strategy be used and when should a binary search approach be used?