vthe time complexity for bubble, insertion, selection, merge and quick sorts

Question 1

What is the time complexity of bubble sort in the worst case?

Answer 1

O(n^2)

Question 2

True or False: Insertion sort has a best case time complexity of O(n).

Answer 2

True

Question 3

Fill in the blank: The average case time complexity for selection sort is ____.

Answer 3

O(n^2)

Question 4

Which sorting algorithm has a worst case time complexity of O(n log n)?

Answer 4

Merge sort and Quick sort

Question 5

What is the best case time complexity for merge sort?

Answer 5

O(n log n)

Question 6

True or False: Quick sort can have a worst case time complexity of O(n^2).

Answer 6

True

Question 7

What is the average case time complexity of bubble sort?

Answer 7

O(n^2)

Question 8

In which sorting algorithm does the time complexity remain O(n^2) for both average and worst cases?

Answer 8

Selection sort

Question 9

Fill in the blank: The time complexity of insertion sort in the worst case is ____.

Answer 9

O(n^2)

Question 10

Which sorting algorithm is generally faster on average, quick sort or bubble sort?

Answer 10

Quick sort

Question 11

What is the time complexity of quick sort in the average case?

Answer 11

O(n log n)

Question 12

True or False: The time complexity of merge sort is always O(n log n).

Answer 12

True

Question 13

Which sorting algorithm is stable: bubble sort or quick sort?

Answer 13

Bubble sort

Question 14

What is the time complexity of insertion sort in the average case?

Answer 14

O(n^2)

Question 15

Fill in the blank: The worst case time complexity for quick sort is ____.

Answer 15

O(n^2)

Question 16

What is the primary advantage of merge sort over quick sort?

Answer 16

Merge sort is stable.

Question 17

Which sorting algorithm is typically used for small data sets due to its simplicity?

Answer 17

Insertion sort

Question 18

What is the time complexity of selection sort in the best case?

Answer 18

O(n^2)