Sorting Algorithms Quiz No 2

Which sorting algorithm repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order?

• MergeSort

• QuickSort

• BubbleSort

• InsertionSort

Which sorting algorithm selects an element as a pivot and partitions the array around the pivot?

• QuickSort

• MergeSort

• SelectionSort

• HeapSort

Which sorting algorithm builds the final sorted array one item at a time by repeatedly taking the minimum element from the unsorted part and placing it at the beginning?

• BubbleSort

• MergeSort

• InsertionSort

• SelectionSort

In which sorting algorithm does the sorting happen by merging two sorted arrays into one?

• QuickSort

• MergeSort

• BubbleSort

• InsertionSort

Which sorting algorithm is known for its simplicity and effectiveness for small datasets or partially sorted arrays?

• QuickSort

• BubbleSort

• InsertionSort

• MergeSort

Which sorting algorithm is considered unstable, meaning it may change the relative order of elements with equal keys?

• QuickSort

• MergeSort

• SelectionSort

• BubbleSort

Which sorting algorithm's worst-case time complexity is O(n^2) and best-case time complexity is O(n log n)?

• MergeSort

• QuickSort

• BubbleSort

• InsertionSort

Which sorting algorithm does not use recursion in its implementation?

• MergeSort

• QuickSort

• BubbleSort

• InsertionSort

Which sorting algorithm is suitable for sorting small arrays or nearly sorted arrays efficiently?

• InsertionSort

• MergeSort

• QuickSort

• SelectionSort

Which sorting algorithm divides the input array into two halves, sorts the halves separately, and then merges them?

• QuickSort

• MergeSort

• BubbleSort

• InsertionSort