// Select an algorithm to see its code
Select an algorithm and click visualize to see the explanation of each step.
| Algorithm | Worst-Case Time | Average-Case Time | Best-Case Time | Space Complexity | Requirements |
|---|---|---|---|---|---|
| Linear Search | O(n) | O(n) | O(1) | O(1) | None |
| Binary Search | O(log n) | O(log n) | O(1) | O(1) | Sorted array |
| Jump Search | O(√n) | O(√n) | O(1) | O(1) | Sorted array |
| Interpolation Search | O(n) | O(log log n) | O(1) | O(1) | Sorted, uniformly distributed |
| Exponential Search | O(log n) | O(log n) | O(1) | O(1) | Sorted array |
| Fibonacci Search | O(log n) | O(log n) | O(1) | O(1) | Sorted array |
| Ternary Search | O(log₃ n) | O(log₃ n) | O(1) | O(1) | Sorted array |