Category Reference

Algorithms

Step-by-step procedures for solving computational problems efficiently.

Big-O Notation

6 min read • Reference

Complexity analysis. Explore complete syntax, detailed definitions, and structured coding examples.

Binary Search

6 min read • Reference

O(log n) search. Explore complete syntax, detailed definitions, and structured coding examples.

Bubble Sort

6 min read • Reference

Simple comparison sort. Explore complete syntax, detailed definitions, and structured coding examples.

Merge Sort

6 min read • Reference

Divide and conquer. Explore complete syntax, detailed definitions, and structured coding examples.

Quicksort

6 min read • Reference

Partition-based sort. Explore complete syntax, detailed definitions, and structured coding examples.

Breadth-First Search

6 min read • Reference

Level-order traversal. Explore complete syntax, detailed definitions, and structured coding examples.

Depth-First Search

6 min read • Reference

Stack-based traversal. Explore complete syntax, detailed definitions, and structured coding examples.

Dynamic Programming

6 min read • Reference

Memoization and tables. Explore complete syntax, detailed definitions, and structured coding examples.

Greedy Algorithms

6 min read • Reference

Locally optimal choices. Explore complete syntax, detailed definitions, and structured coding examples.

Two Pointers

6 min read • Reference

Array optimization. Explore complete syntax, detailed definitions, and structured coding examples.

Sliding Window

6 min read • Reference

Subarray problems. Explore complete syntax, detailed definitions, and structured coding examples.

Dijkstra's Algorithm

6 min read • Reference

Shortest path. Explore complete syntax, detailed definitions, and structured coding examples.

Backtracking

6 min read • Reference

Exhaustive search. Explore complete syntax, detailed definitions, and structured coding examples.