ITCC 104 - QUIZ 4

Which sorting algorithm is known for its simplicity and is efficient for small data sets or partially sorted arrays?

• Selection Sort

• Bubble Sort

• Insertion Sort

• Merge Sort

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

• Insertion Sort

• Merge Sort

• Quick Sort

• Bubble Sort

Which sorting algorithm divides the array into two halves, sorts each half separately, and then merges the sorted halves?

• Insertion Sort

• Merge Sort

• Bubble Sort

• Selection Sort

Which sorting algorithm is known for its space efficiency and stable sorting property?

• Quick Sort

• Merge Sort

• Insertion Sort

• Selection Sort

Which sorting algorithm is often used for sorting linked lists due to its simplicity and suitability for that data structure?

• Quick Sort

• Merge Sort

• Bubble Sort

• Insertion Sort

Which sorting algorithm works by repeatedly selecting the minimum element from the unsorted portion and moving it to the beginning?

• Merge Sort

• Bubble Sort

• Quick Sort

• Selection Sort

Which sorting algorithm is based on the divide and conquer strategy?

• Bubble Sort

• Insertion Sort

• Merge Sort

• Selection Sort

Which sorting algorithm works by repeatedly partitioning the array into two parts around a pivot element?

• Merge Sort

• Quick Sort

• Bubble Sort

• Selection Sort

Which sorting algorithm is not comparison-based, making it suitable for certain types of data?

• Radix Sort

• Quick Sort

• Merge Sort

• Bubble Sort

Which sorting algorithm is suitable for sorting nearly sorted or already sorted arrays efficiently?

• Insertion Sort

• Quick Sort

• Merge Sort

• Bubble Sort