DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
A comprehensive comparison of all searching algorithms — linear search, binary search, interpolation search, ternary search, hash-based search, and tree-based search — with performance tables, use cases, and a decision guide for every scenario.
All Search Algorithms at a Glance
| Algorithm | Time (Average) | Time (Worst) | Space | Requires | Best For |
|---|---|---|---|---|---|
| Linear Search | O(n) | O(n) | O(1) | Nothing | Unsorted, small arrays |
| Binary Search | O(log n) | O(log n) | O(1) | Sorted array | Sorted arrays, repeated queries |
| Interpolation | O(log log n) | O(n) | O(1) | Sorted + Uniform | Uniformly distributed sorted data |
| Ternary Search | O(log n) | O(log n) | O(1) | Unimodal | Finding max/min of unimodal function |
| Hash Map Lookup | O(1) average | O(n) | O(n) | Hash map built | Exact match, repeated queries |
| BST Search | O(log n) | O(n) | O(n) | Balanced BST | Dynamic sorted data |
| Trie Search | O(m) | O(m) | O(m×Σ) | Trie built | Prefix searches, string sets |
Where m = string/key length, Σ = alphabet size
Decision Guide
| ├── NO | Linear Search (only option without preprocessing) |
| │ Exception | If you'll search many times, |
| ├── YES | Consider Interpolation Search |
| └── NO | Binary Search (reliable O(log n) always) |
| └── YES and function is unimodal | Ternary Search |
| └── YES | Hash Map (best average-case performance) |
| └── YES | Binary Search Tree or balanced BST |
| └── YES | Trie (O(m) per search, m = prefix length) |
Detailed Comparison by Scenario
Scenario 1 — One-time search in unsorted data
Example
# Only option: linear search
arr = [random values]
target = 42
idx = next((i for i, x in enumerate(arr) if x == target), -1)
# O(n) — no way around it
Winner: Linear Search — no preprocessing, immediate answer.
Scenario 2 — Repeated searches in static sorted data
Example
# Binary search: O(log n) per query, O(1) space
sorted_arr = [sorted values]
idx = binary_search(sorted_arr, target)
# Hash map: O(1) per query, O(n) space
lookup = {val: idx for idx, val in enumerate(sorted_arr)}
idx = lookup.get(target, -1)
For 1 search: both equivalent. For 1000 searches: hash map wins dramatically.
Winner: Hash Map for frequent queries. Binary Search when memory is limited.
Scenario 3 — Dynamic data (insertions and deletions mixed with searches)
python example
from sortedcontainers import SortedList # Python library
sl = SortedList()
sl.add(5); sl.add(3); sl.add(8)
idx = sl.index(5) # O(log n) search maintained automaticallyWinner: Balanced BST (SortedList, TreeSet in Java, std::set in C++).
Scenario 4 — Prefix-based string searching (autocomplete)
| Query: "prog" | find all strings starting with "prog" |
| Linear search | check all n strings, O(n×m) total |
| Trie: traverse root | p→r→o→g in 4 steps, then enumerate children |
Winner: Trie by a large margin.
Scenario 5 — Finding minimum in rotated sorted array
Example
def find_min(nums):
left, right = 0, len(nums) - 1
while left < right:
mid = left + (right - left) // 2
if nums[mid] > nums[right]:
left = mid + 1
else:
right = mid
return nums[left]
Winner: Modified Binary Search — O(log n), exploits sorted structure.
Common Mistakes in Choosing Search Algorithm
Mistake 1 — Using linear search on sorted data
Example
# Slow
def find_in_sorted_WRONG(sorted_arr, target):
for x in sorted_arr: # O(n) — wastes sorted property
if x == target: return True
return False
# Fast
def find_in_sorted_CORRECT(sorted_arr, target):
lo, hi = 0, len(sorted_arr) - 1
while lo <= hi: # O(log n)
mid = (lo + hi) // 2
if sorted_arr[mid] == target: return True
elif sorted_arr[mid] < target: lo = mid + 1
else: hi = mid - 1
return False
Mistake 2 — Using list .index() (O(n)) when hash map would be O(1)
Example
arr = [3, 1, 4, 1, 5, 9, 2, 6]
# Slow: O(n) per call
for query in queries:
idx = arr.index(query) # O(n) linear search inside!
# Fast: O(1) per call after O(n) preprocessing
index_map = {val: i for i, val in enumerate(arr)}
for query in queries:
idx = index_map.get(query, -1) # O(1)
Mistake 3 — Not accounting for preprocessing cost
python example
# If you sort ONCE for binary search: O(n log n) + O(log n) per query
# Total for k queries: O(n log n + k log n)
# If you use hash map: O(n) build + O(1) per query
# Total for k queries: O(n + k)
# For k = 1: binary search total = O(n log n + log n) = O(n log n)
# hash map total = O(n + 1) = O(n)
# → Hash map wins even for 1 query!
# For k = 0 (just searching once, no preprocessing): linear search O(n) winsMemory-Performance Tradeoff Summary
| Binary │ O(log n) │ O(1) │ Sort | O(n lgn)│ |
| Hash Map │ O(1) average │ O(n) │ Build | O(n) │ |
| BST (bal.) │ O(log n) │ O(n) │ Build | O(n lgn│ |
| Trie │ O(m) per query │ O(n×Σ) │ Build | O(n×m) │ |
Summary — The Three Main Choices
Use Linear Search when:
- Data is unsorted and searching only once
- n is small (< 100)
- Memory is extremely tight
- Searching by complex condition
Use Binary Search when:
- Data is already sorted (or can be sorted once)
- Memory efficiency matters
- Worst-case guarantee of O(log n) required
Use Hash Map when:
- Exact key lookups are frequent
- O(n) extra memory is acceptable
- O(1) average lookup is required
Everything else — dynamic sorted data → BST; prefix searches → Trie; unimodal optimization → Ternary Search.
*Next Lesson: Searching Interview Problems*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Search Algorithm Comparison — Choosing the Right Search for Every Situation.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, searching, search, comparison
Related Data Structures & Algorithms Topics
Continue learning this concept
SearchingBinary Search — Complete Guide with All Variants and Proof of CorrectnessMaster binary search completely — the core algorithm with loop invariant proof, iterative and recursive implementations, all variants (leftmost, rightmost, lower bound, upper bound), binary search on answer space, and 10 classic interview problems.SearchingInterpolation Search — O(log log n) Search for Uniformly Distributed DataMaster interpolation search — how it improves on binary search using value-based position estimation, when it achieves O(log log n) vs O(n) worst case, the interpolation formula, comparison with binary search, and when to use each.SearchingLinear Search — Complete Guide with All Variants and ApplicationsMaster linear search completely — sequential search, sentinel search, searching with conditions, finding all occurrences, searching in linked lists and 2D arrays, when to use linear search vs alternatives, and the exact time and space complexity analysis.SearchingTernary Search — Finding Maximum/Minimum of Unimodal FunctionsMaster ternary search — what it is, why it differs from binary search, how to find the maximum or minimum of a unimodal function in O(log n), ternary search on sorted arrays vs functions, comparison with binary search, and classic applications.SearchingSearching Interview Problems — 10 Classic Problems with Complete SolutionsSolve 10 classic searching interview problems — find in rotated sorted array, search in 2D matrix, find peak element, kth smallest in sorted matrix, find duplicate, median of two sorted arrays, capacity to ship packages, aggressive cows, and more.ArraysArray Searching — Linear Search, Binary Search, and Advanced TechniquesComplete guide to searching arrays — linear search with early termination, binary search with all variants, interpolation search, and exponential search. Includes full implementations, complexity analysis, and classic search-based interview problems.