DSAlabL910IT

What is the primary purpose of sorting algorithms?

• To decrease the size of the array

• To arrange items in a specific order

• To delete duplicate values

• To convert numerical values to text

Which of the following sorting algorithms is based on the divide-and-conquer technique?

• Selection Sort

• Merge Sort

• Bubble Sort

• Insertion Sort

Which sorting algorithm always ensures the smallest element is placed first in the sorted part of the array?

• Bubble Sort

• Merge Sort

• Selection Sort

• Quick Sort

What is the time complexity of Bubble Sort in its worst case?

• O(nlog⁡n)O(n \log n)O(nlogn)

• O(n)O(n)O(n)

• O(n2)O(n^2)O(n2)

• O(1)O(1)O(1)

Which sorting algorithm uses a pivot element to partition the array?

• Quick Sort

• Shell Sort

• Insertion Sort

• Bucket Sort

Which of the following sorting algorithms is considered stable?

• Quick Sort

• Merge Sort

• Selection Sort

• Heap Sort

In-place sorting means the algorithm requires:

• Extra space equal to the size of the input array

• Constant or no extra space

• More time for sorting

• Recursive calls

Which sorting algorithm divides the list into sub-lists based on intervals?

• Merge Sort

• Shell Sort

• Bubble Sort

• Quick Sort

What is the worst-case time complexity of Quick Sort?

• O(n)O(n)O(n)

• O(nlog⁡n)O(n \log n)O(nlogn)

• O(n2)O(n^2)O(n2)

• O(log⁡n)O(\log n)O(logn)

Which sorting algorithm works well with small or medium-sized datasets and is based on insertion?

• Shell Sort

• Quick Sort

• Heap Sort

• Radix Sort