Contents Menu Expand Light mode Dark mode Auto light/dark, in light mode Auto light/dark, in dark mode Skip to content
Site is still under construction !
DSA Panicle
Logo

Array & String

  • Sliding Window
    • Fixed Window
    • Longest Sub{string,array}
    • Shortest Sub{string,array}
    • Return Count,Indices
  • One Pass
  • Two Pointers
    • Read Write Heads
    • Left Right Heads
    • 2 Heads for 2 Arrays

Linked List

  • Singly Linked List
    • Basics
  • Doubly Linked List
    • Basics

Search & Sort

  • Binary Search
    • O(logN) , O(sort)
    • Secondary loop BS
    • Monotone Function, O(NlogN)

Tree

  • Binary Tree
    • All Traversal
    • Level, Height, Depth
    • Path
    • Side Views, Two Trees
    • Recursion with Return
    • Manipulate Tree
  • N-ary Tree
    • All Traversals
  • Binary Search Tree
    • Manipulate Tree
    • All Traversals

Design & Simulation

  • Array, Hash

Dynamic Programming

  • Fibonacci series
  • Longest Subsequence

Maths & Bits

  • Bit Manipulation
  • Math
Back to top
View this page
Edit this page

Binary SearchΒΆ

Table of Content

  • O(logN) , O(sort)
    • The Classic Binary Search Algorithm
    • Bisect Algorithms
    • Bisect Derivatives
    • Bisect left & right
    • Slight Variants
    • Math - Square
    • Missing Elements
    • Rotated Sorted Array
    • Peaks in an Array
    • H Index
  • Secondary loop BS
    • Bisect derivatives
    • Bisect derivatives in 2D Matrix
    • Intersection
    • Custom Bisect
  • Monotone Function, O(NlogN)
    • Split Input Array
    • Kth Smallest
Next
O(logN) , O(sort)
Previous
Basics
Copyright © 2024, Abhishek R
Made with Sphinx and @pradyunsg's Furo