A linear scan checks every element in $O(n)$ time, while binary search uses a sorted array to halve the search space each step, finding a value in $O(\log n)$. Quickselect borrows quicksort’s partitioning to find the $k$-th smallest element in expected $O(n)$ time without sorting the whole array.