01When is Linear Search better than Binary Search?
02What is the worst-case number of comparisons for Binary Search on 1,000 elements?
03In Binary Search, why use `mid = low + (high - low) / 2`?
04What is 'Ternary Search'?
05Which search algorithm uses a 'probe' based on the value's likely position?
06What is the complexity of Interpolation Search in the average case?
07How does 'Jump Search' work?
08What is the optimal block size for Jump Search?
09Can Binary Search be implemented recursively?
10What is the complexity of Linear Search on a sorted array if the target is not present?