Design and Analysis of Algorithms Lab Quiz

What is best case complexity of Insertion Sort?

• $\Omega\left(n^2\right)$

• $\Omega\left(n\right)$

• $\Omega\left(n\log_2n\right)$

• $\Omega\left(1\right)$

What is the worst case complexity of Quick Sort?

• $O\left(n^2\right)$

• $O\left(n\log_2n\right)$

• $O\left(n\right)$

• $O\left(1\right)$

What is the worst case complexity of Merge Sort?

• $O\left(n^2\right)$

• $O\left(n\log_2n\right)$

• $O\left(n\right)$

• $O\left(1\right)$

What is the best case complexity of Bubble sort?

• $\Omega\left(n^2\right)$

• $\Omega\left(n\right)$

• $\Omega\left(n\log_2n\right)$

• $\Omega\left(n^2\log_2n\right)$

What is the worst case complexity of selection sort?

• $O\left(n^2\right)$

• $O\left(n\log_2n\right)$

• $O\left(n\right)$

• $O\left(1\right)$

What will be the complexity of Quick sort while data is already sorted in increasing order?

• $O\left(1\right)$

• $O\left(n\right)$

• $O\left(n\log_2n\right)$

• $O\left(n^2\right)$

What will be the worst case complexity of Merge Sort while data is already sorted in increasing order?

• $O\left(1\right)$

• $O\left(n\right)$

• $O\left(n\log_2n\right)$

• $O\left(n^2\right)$

Which one of the following sorting algorithm uses divide and conquer approach?

• Selection Sort

• Insertion Sort

• Merge Sort

• Bubble Sort

Which one of the following sorting algorithm always divides its data into almost two equal half ?

• Selection Sort

• Quick Sort

• Merge Sort

• Bubble Sort

Which one of the following uses divide, conquer and combine approach?

• Quick Sort

• Merge Sort

• Selection

• Counting Sort