• Point Zero
  • Teaching
  • Blog Posts
  • Publications
  • Apps
  • Games
  • Search
    Teaching › Algorithms › Search Algorithms

    Chapter 4 · Simulation

    Search Algorithms

    ← Chapter 4
    Algorithm–
    Comparisons0
    StatusReady.

      Search Algorithms

      Compare linear, binary and jump search step by step on the same array.

      How to use

      • Type a target value (0–99) and press Linear, Binary or Jump. The orange bar is the element being compared; faded bars lie outside the part of the array that is still being examined.
      • Binary and jump search only work on sorted data, so they sort the array first.
      • New array generates 16 random values; Speed changes the animation delay. The marks below the bars show L / M / R (left, middle, right) in binary search and the current block (jump, end) in jump search.

      Linear search

      Checks the values one by one. It does not need a sorted array; the worst case takes O(n) time.

      Binary search

      Needs sorted data and repeatedly halves the remaining search range; the worst case takes O(log n) time.

      Jump search

      Needs sorted data. It jumps ahead in steps of about √n positions, then does a short linear scan; the worst case takes O(√n) time.

      AlgorithmNeeds sorted data?Worst casen = 16
      LinearNoO(n)16 comparisons
      BinaryYesO(log n)5 comparisons
      JumpYesO(√n)about 8 comparisons
      • Follow:
      • GitHub
      • Feed
      © 2026 Sercan Külcü, Powered by Jekyll & AcademicPages, a fork of Minimal Mistakes.
      Site last updated 2026-11-22, Sitemap