Algorithm Visualizer

A simple sorting algorithm that repeatedly steps through the list

O(n²)O(1)

2. Insertion Sort

Sorts an array by inserting elements into their correct position

O(n²)O(1)

3. Selection Sort

Simple sorting algorithm that repeatedly finds the minimum element

O(n²)O(1)

4. Merge Sort

Divides the array into halves and merges them in sorted order

O(n log n)O(n)

5. Quick Sort

Efficient divide-and-conquer sorting algorithm

O(n log n)O(log n)

Searching

2 algorithms

1. Linear Search

Simple search algorithm that checks each element sequentially

2. Binary Search

Efficient search algorithm for sorted arrays

O(log n)O(1)

Pattern

6 algorithms

1. Sliding Window

Efficiently solve problems involving subarrays or substrings of fixed size.

2. Two Pointers

Technique using two pointers to solve array problems efficiently

3. Kadane's Algorithm

Find the maximum sum subarray in a given array.

4. Prefix Sum

O(n) build, O(1) queryO(n)

Build cumulative sums for O(1) range queries and subarray problems.

5. Monotonic Stack

Find next greater elements using a monotonic decreasing stack.

O(n)O(n)

6. Fast & Slow Pointers

Two pointers technique for cycle detection and pattern finding

Linked List

1 algorithm

1. Reverse Linked List

Reverse the direction of pointers in a linked list iteratively

Tree

1 algorithm

1. Tree Traversal

Explore preorder, inorder, postorder, and level-order tree traversal techniques.

O(n)O(h)

Graph

2 algorithms

1. Graph Traversal

Explore DFS and BFS algorithms for traversing graph data structures.

O(V + E)O(V)

2. Dijkstra's Algorithm

hard

Finds shortest paths from source to all vertices

O(V² + E)O(V)

Heap

1 algorithm

1. Top K Elements