CS Vis
  • Algorithms
    • Graphs & Trees
    • Sorting
    • Searching & Arrays
    • Dynamic Programming
    • Divide & Conquer
    • Greedy Algorithms
  • Theory
    • Computation
    • Complexity
  • Regular Languages
    • DFA
    • NFA
    • DFA → Regex
  • Context-Free Languages
    • CFG
    • PDA
    • CFG → CNF
  • Turing Machine
  • Testing
    • Combinatorial
    • Control FlowNew
    • SubsumptionNew
  • FAQ
  • About
  • Contact
Algorithms
  • Graphs & Trees
  • Sorting
  • Searching & Arrays
  • Dynamic Programming
  • Divide & Conquer
  • Greedy Algorithms
CS Vis
  • Turing Machine
Algorithms
  • Graphs & Trees
  • Sorting
  • Searching & Arrays
  • Dynamic Programming
  • Divide & Conquer
  • Greedy Algorithms
Theory
  • Computation
  • Complexity

Regular Languages

  • DFA
  • NFA
  • DFA → Regex

Context-Free Languages

  • CFG
  • PDA
  • CFG → CNF
Testing
  • Combinatorial
  • Control FlowNew
  • SubsumptionNew
  • FAQ
  • About
  • Contact

Preferences

Language
Theme
All Domains

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.

Median of Two Sorted Arrays

Finds the median of two sorted arrays in O(log(min(m,n))) by binary-searching a partition of the shorter array.

Request more
Missing something? Get in touch and we'll add it.
Home·About·FAQ·What's New
·Credits·Privacy Policy

© 2026 CSVisualizer.com