Algorithm Library

Contiguous memory structures. Basic indexing, search, and memory management.

Nodes and pointers. Dynamic memory allocation with insertion and traversal.

Repeatedly steps through the list, swaps adjacent elements if they are in the wrong order.

Builds the final sorted array one item at a time, efficient for small data sets.

Divides the input list into two parts: sorted and unsorted, picking the minimum.

Divide and conquer algorithm that splits the array and merges sorted subarrays.

Picks a pivot element and partitions the array around the pivot.

Sequentially checks each element of the list until a match is found.

Search a sorted array by repeatedly dividing the search interval in half.

Finds an element in a sorted array that has been rotated at some pivot.

Determines the maximum or minimum of a unimodal function/array.

Hierarchical structures. DFS (In-order, Pre-order, Post-order) and BFS logic.

Calculate height, depth, and size of binary search trees.