The partitioning algorithm in quick sort is a __________ algorithm. (divide and conquer, greedy

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

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

Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?a) Insertion Sortb) Quick Sortc) Heap Sortd) Merge Sort

QUESTION 22 Evaluating Sorts Given the following array: 4, 6, 1, 7, 8, 0 Show what the array looks like after the 2rd swap of a Selection Sort in ascending order.

//Algorithm should: /*NOT destroy any of the originally even-valued node.     This means that the originally even-valued nodes should be retained as part of the resulting list.    Destroy ONLY nodes that are originally odd-valued.    Create new nodes and copy data between nodes ONLY when duplicating originally even-valued nodes.    Only ONE new node should be created for each originally even-valued node.    Creating pointer-to-node's (to provide temporary storage for node addresses) does not constitute creating new nodes or copying of items.    NOT make any temporary copies of any of the data items (using any kind of data structures including but not limited to arrays, linked lists and trees).    This means that the algorithm should largely involve the manipulation of pointers.    Function must be iterative (NOT recursive) - use only looping construct(s), without the function calling itself (directly or indirectly).    Function should not call any other functions to help in performing…