Visualize and understand how different search algorithms work step by step.
This visualization tool helps you understand how different search algorithms locate an element in an array. You can control the search process step by step, change the array size, and select different algorithms to compare their efficiency and behavior.
Sequentially checks each element until a match is found or the whole array is searched. Time Complexity: O(n)
Divides the search interval in half repeatedly until the target value is found or the interval is empty. Time Complexity: O(log n)
Jumps ahead by fixed steps and then uses linear search to find the element. Time Complexity: O(√n)
Step 0 of 0
Ready to search