Skip to main content
Navigation
Visualizers

Arrays

Sliding Window • Prefix Sum

Sorting

Merge • Quick • Heap

String

KMP • Rabin-Karp

LinkedList

Singly • Doubly • Cycle

Stack

LIFO • Monotonic

Queue

FIFO • Priority Deque

Hashing

Maps • Sets • Collision

Recursion

Base Case • Call Stack

Trees

BST • AVL • Traversal

Heaps

Min-Heap • Max-Heap

Tries

Prefix Tree • Autocomplete

Graphs

BFS • DFS • Dijkstra

Greedy

Activity Selection • Huffman

Dynamic Programming

Memoization • Tabulation

Backtracking

N-Queens • Sudoku

Bit Manipulation

XOR • Shifts • Masks

Sliding Window

Fixed • Dynamic

Two Pointers

Collision • Parallel

Array Vis

Interactive Learning
10
0
25
1
30
2
45
3
50
4
65
5
70
6
85
7
90
8
1x
Algorithm Details
Time Complexity
BestO(1)
AverageO(n)
WorstO(n)

Checks each element sequentially until the target is found or the end is reached.

Algorithm Logic
1Algorithm LinearSearch(array, target):
2 For each index i from 0 to length - 1:
3 If array[i] == target:
4 Return i (Found)
5
6 Return -1 (Not Found)