Sorting Algorithms Quiz

What is the main purpose of sorting?

• To arrange data in ascending or descending order

• To arrange data in a random order

• To delete data from a collection

• To merge two datasets

Which sorting method is applied when the number of data elements is too large?

• Quick sort

• Internal sorting

• External sorting

• Insertion sort

What is the time complexity of Insertion Sort in the worst case?

• O(n log n)

• O(n)

• O(n^2)

• O(1)

Which of the following sorting algorithms is not stable?

• Shell sort

• Merge sort

• Quick sort

• Insertion sort

What is the space complexity of Insertion Sort?

• O(n)

• O(log n)

• O(n^2)

• O(1)

In Quick Sort, what is the role of the pivot?

• To merge sorted arrays

• To sort the entire array

• To find the maximum element

• To divide the array into two parts

Which sorting algorithm uses a divide and conquer strategy?

• Insertion sort

• Bubble sort

• Merge sort

• Selection sort

What is the best case time complexity for Quick Sort?

• O(n^2)

• O(n log n)

• O(log n)

• O(n)

Which sorting algorithm is described as a simple and efficient comparison-based algorithm?

• Heap sort

• Insertion sort

• Merge sort

• Quick sort

What is the main disadvantage of Insertion Sort?

• It is complex to implement

• It requires extra memory

• It is inefficient for large lists

• It is not stable