Skip to main content

/Searching/Linear Search

1 / 7

Speed

/

Big O Notation Recursion Two Pointers Sliding Window Space Complexity Worst-case Analysis Memoization Greedy vs DP

Stack Queue Linked List Hash Table Binary Search Tree Heap Union-Find / Disjoint Sets Red-Black Tree

Bubble Sort Selection Sort Insertion Sort Quick Sort Merge Sort Heap Sort Counting Sort Radix Sort Shell Sort Bucket Sort

Binary Search Linear Search Jump Search Interpolation Search Quickselect / Median Finding

Breadth-First Search Depth-First Search Dijkstra's Algorithm Prim's Algorithm Kruskal's MST Topological Sort

Fibonacci DP Knapsack 0/1 Longest Common Subsequence

N-Queens Problem Sudoku Solver Maze Pathfinding

Sieve of Eratosthenes

45 algorithms·by Sai Rithwik Kukunuri

Linear Search — Searching

Custom array

Whole numbers 1–99, up to 16

Target value

Target value

14

33

27

10

35

19

42

44

0

1

2

3

4

5

6

7

Step 1:Unsorted array. Searching for target: 35

Variables

target==35

array.length==8