sorting techniques

1. What is the time complexity of Bubble Sort in the worst-case scenario?

• a. O(1)

•    b. O(n log n)  

     

•  O(n) 

• O(n^2)

2. In Selection Sort, what is maintained during the execution of the algorithm?

• Two subarrays - sorted and unsorted

• A priority queue

• Binary search tree 

• A linked list

3. Which sorting algorithm is known for maintaining a sub-array that is always sorted during its execution?

• Quick Sort

• Merge Sort

• Insertion Sort 

• Non of the above

Insertion Sort has a better average and worst-case time complexity compared to Selection Sort.

• True

• False

Bubble Sort not occupies extra memory space during its execution.

• True

• False