tri game

What is sorting?

• Searching for an element

• Arrangement of elements

• Rearrangement of elements

• All of the above

Which of the following is a comparison-based sorting algorithm?

• Counting Sort

• Radix Sort

• Quick Sort

• Bucket Sort

Which sorting algorithm works by repeatedly swapping adjacent elements if they are in the wrong order?

• Merge Sort

• Insertion Sort

• Heap Sort

• Selection Sort

Which sorting algorithm is known for its stability?

• Quick Sort

• Heap Sort

• Merge Sort

• Selection Sort

Which sorting algorithm has a time complexity of O(n^2) in the worst-case scenario but is still used for its simplicity?

• Merge Sort

• Quick Sort

• Bubble Sort

• Insertion Sort

Which sorting algorithm has both average-case and worst-case time complexity of O(n log n) but is not comparison-based?

• Radix Sort

• Bucket Sort

• Counting Sort

• Quick Sort

What is the time complexity of Quick Sort in the best-case scenario?

• O(n)

• O(n log n)

• O(n^2)

• O(log n)

What is the time complexity of Heap Sort in the worst-case scenario?

• O(n)

• O(n log n)

• O(n^2)

• O(log n)

Which sorting algorithm is suitable for sorting integers with a limited range?

• Merge Sort

• Quick Sort

• Counting Sort

• Radix Sort

Which sorting algorithm is commonly used for sorting elements in computer graphics?

• Merge sort

• Quick sort

• Radix sort

• Bucket Sort