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

1 Sequence (46, 79, 56, 38, 40, 84), using quick sorting (with the leftmost element as the pivot), the first partition result is: OA 38 46 79 56 40 84 OB 38 79 56 46 40 84 OC 40 38 46 56 79 84 OD 38 46 56 79 40 84 2 Each time an element is taken from the unsorted sequence, compared with the elements in the sorted sequence, and then inserted into the appropriate position in the sorted sequence. What is the name of this sort method? A Bubble sort OB Direct insert sort OC Select sort OD Merge sort

Order these three sorting algorithms according to their BEST-case running time. The fastest should be first, and the slowest should be last. Fastest (the best one) 1 | Merge Sort E Insertion Sort 3 : Selection Sort 4 : Bubble Sort

3. What is the best sorting algorithm can be combined with the following and explain the reason briefly: (a) Radix Sort (b) Bucket Sort

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

Pls. answer the 2 questions. write a short explanation each.

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

Given a list containing the values: 8 7 59 3 4. a. Perform a trace of bubble sort as it would sort this list. b. What is the efficiency of bubble 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

Create and test assumptions regarding the running times of insertion sort and selection sort for arrays with just two key values, assuming the values are equally likely to occur.