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?

Which of the following algorithms is better to sort a mostly sorted data sequence? A data sequence is mostly sorted if only a handful of integers don't appear in the longest sorted subsequence. For example, the following data sequence is almost sorted since there is only one integer (0) out of place in a sorted sequence of numbers:  1, 2, 3, 4, 0, 5, 6, 7, 8, 9   Question 28 options:   merge sort   selection sort   insertion sort   quick sort

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…

Use a merge sort to sort 3,6,9,4,2,10, 8, 1,7,5 into increasing order. Show all steps used by the algorithm

1. Explore Merge Sort Algorithm, also perform dryRun on a set of examples.2. Find the Time Complexity of Merge Sort Algorithm.

Define Merge Sort algorithm.  Sort the following array of elements using the Merge Sort algorithm.   13, 9, 15 ,8 , 5, 11

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

step Sort the sequence {1, 5, 7, 6, 8, 9} using the Bubble sort algorithm. Show the step. Do llege of Te of Technol& Technology even if Exam, ogy Exam, 202 AN ST 021S, NYC C NYC Colle same. YC College College of Tech ge of Techno of Technology% echnology Ex logy Exam, 20 xam ege of Tech inology Ex nnology Exam Exam, 20

i just need answer not process  please quickly thanks !

6. Below is a table that shows the timing of three different algorithms using an array of integers as input. Explain which of the algorithms is most likely the selection sort and which is the merge sort, explain in details your answer. Algorithm 1 Algorithm 2 Algorithm 3 time to process 2000 integers 0.1431 sec 0.8011 sec 0.0132 sec time to process 4000 integers 0.5722 sec 1.4300 sec 0.0304 sec time to process 8000 integers 2.2989 sec 2.4512 sec 0.0634 sec