What is Searching?

Searching is the process of finding the location of a specific item in a collection of items. In computer science, searching algorithms are essential for retrieving information efficiently.

In this visualizer, you can explore various searching algorithms, each with its unique method of finding elements in data. From basic ones like Linear Search to advanced methods like A* and Best-First Search, you’ll see how each works and what makes them effective.

Search Algorithm Visualizer

Discover and understand different search algorithms through interactive visualizations. Select an algorithm to see how it locates items step by step.

Linear Search

A simple search algorithm that checks each element one by one.

Binary Search

An efficient algorithm for finding an item in a sorted list by repeatedly dividing the search interval in half.

Depth-First Search (DFS)

An algorithm for traversing or searching tree or graph data structures by exploring as far as possible along each branch.

Breadth-First Search (BFS)

An algorithm for searching a tree or graph by exploring neighbors level by level.

Jump Search

An algorithm for searching in a sorted array by jumping ahead fixed steps and then performing a linear search.

Interpolation Search

An improvement over Binary Search that works on uniformly distributed sorted data.

Exponential Search

An algorithm that works particularly well on unbounded or infinite lists, doubling the search range exponentially.

Best-First Search (Greedy Search)

An algorithm that uses a priority queue to expand the most promising nodes first.

A* Search

A powerful search algorithm that combines heuristics and cost functions to find the optimal path in a graph.

Fibonacci Search

An algorithm similar to Binary Search but using Fibonacci numbers to divide the array.