How does Quadratic Probing resolve hash collisions compared to Linear Probing?
Quadratic probing adds quadratic offsets $i^2$ to probe locations, spreading out collision locations to prevent primary clustering.
What is the average-case time complexity of Interpolation Search on a uniformly distributed sorted array?
Interpolation search estimates target position using linear interpolation, achieving O(log log N) average time on uniformly distributed data.
Why is Heap Sort considered an unstable sorting algorithm?
Heapifying performs long-distance element swaps during heap construction and extraction, which does not preserve initial relative order of equal elements.
How many comparisons does Selection Sort perform in total on N elements, assuming the standard implementation scans the remaining unsorted portion each pass?
The total number of comparisons is (N-1)+(N-2)+...+1 = N(N-1)/2. Since this exact expression is not among A-C, the correct choice is E: None of the above.
How many total comparisons are executed by Selection Sort on an array of N elements in worst case?
Selection Sort scans unsorted suffixes to find minimums, executing (N-1) + (N-2) + ... + 1 = N(N-1)/2 comparisons regardless of initial array ordering.