AlgoVis
  • Graphs & Trees
  • Sorting
  • Searching & Arrays
  • Dynamic Programming
  • Divide & Conquer
  • Greedy Algorithms
  • About
  • Contact
AlgoVis
  • Graphs & Trees
  • Sorting
  • Searching & Arrays
  • Dynamic Programming
  • Divide & Conquer
  • Greedy Algorithms
  • About
  • Contact

Searching & Arrays

Understand how different search strategies work across data structures.

Binary Search

Efficiently finds an element in a sorted array by halving the search space.

Linear Search

Sequentially checks each element until the target is found.

About·Privacy Policy

© 2026 Dan Tsvyetkov