ITCC104: FINAL EXAMINATION

Why is Bubble Sort called “Bubble” Sort?

• It uses a heap-like structure.
  

• It divides the array in half repeatedly.
  

• Larger values the top as they swap
  

• It selects the minimum value and moves it to the front.

What makes Insertion Sort efficient for nearly sorted arrays?

• It always runs in O(n²) time regardless of input.

• It uses a binary tree to store values.

• It performs fewer comparisons and shifts when data is nearly sorted

• It divides the array using pivot elements.

How does Selection Sort differ from Bubble Sort in process?

• Bubble Sort selects the smallest item directly.
  

• Selection Sort finds the smallest and swaps it once per pass
  

• Bubble Sort only works on even-sized arrays.
  d. Selection Sort only works with strings.

• Selection Sort only works with strings.

What does the divide-and-conquer approach mean in Merge Sort?

• It swaps values from left to right.
  

• It places maximum values at the end.
  

• It breaks the array into parts, sorts them, and merges
  

• It deletes half of the data in each step.

Which characteristic best explains why Heap Sort is not a stable algorithm?

• The rearrangement in heap structure changes equal elements' order

• It merges elements too quickly.
  

• It sorts elements without comparison.
  
  

• It adds new values during the sorting process.

How does Quick Sort choose where to divide the list?

• Based on the largest value in the array
  

• It picks a pivot and partitions around it
  

• It uses the mean of the array
  

• It randomly swaps elements

In what situation would Merge Sort be preferred over Quick Sort?

• When the data is small
  

• When stability is not important
  

• When consistent performance is needed in worst-case scenarios
  

• When memory usage is a major concern

Why is Heap Sort suitable for large datasets with no memory constraints?

• It has the fastest time in all cases
  

• It guarantees O(n log n) time and doesn’t require stability
  

• It uses recursion to store values
  

• It modifies the input data completely

What concept explains how Insertion Sort places each element in its correct location?

• Bubble logic
  

• Partitioning and pivoting
  

• Comparing and shifting into the sorted part

• Binary tree traversal

Why might Bubble Sort be a poor choice for sorting large datasets?

• It uses too much memory
  

• It makes many unnecessary comparisons and swaps

• It requires multiple arrays
  

• It cannot handle strings