What is the key difference between binary search and interpolation search?

A. Interpolation search requires a sorted array.

B. Binary search can handle unsorted arrays.

C. Interpolation search is always faster.

D. Binary search is based on divide-and-conquer, while interpolation search estimates positions.

Answer: Option D