A2 - Sorting Quiz

Identify the complexity of Merge sort for the array of elements 11, 24, 36, 87, 98, 121, 1085.

• O(1)

• O(n log n)

• O(n^2)

• O(n)

Identify the best sorting algorithm for the array of elements 11,24,36,87,98,121,1085

• Insertion Sort

• Quick Sort

• Merge Sort

• Selection Sort

Sort the best case time complexity of Heap, Insertion, Bubble, Selection sort techniques

• Heap > Insertion > Bubble > Selection

• Selection > Heap > Insertion > Bubble

• Selection > Insertion >= Bubble > Heap

• Insertion >= Bubble > Heap > Selection

The array elements are sorted using quick sort technique and it shows the first partitioning of elements, 2 5 1 7 9 12 11 10. Which statement is correct?

• The pivot could be either the 7 or the 9.

• The pivot could be the 7, but it is not the 9

• The pivot is not the 7, but it could be the 9

• Neither the 7 nor the 9 is the pivot

Which of the following is false about merge sort?

• Works better than quick sort if data is accessed from slow sequential memory.

• stable sort by nature

• outperforms heap sort in most of the practical situations.

• Best suitable than bubble sort technique to sort ASCII values