Explore Algorithms

Binary search is a fast search algorithm with run-time complexity of O(log n). This search algorithm works on the principle of divide and conquer.

Binary search in a rotated array is a variation of the binary search with run-time complexity of O(log n). This search algorithm works on the principle of divide and conquer.

Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time.

Merge sort is an efficient, stable, comparison-based, divide and conquer sorting algorithm.

A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.

A graph is a non-linear data structure that consists of nodes and edges. It is used to represent relationships between objects.

A stack is a linear data structure that follows the Last In First Out (LIFO) principle, meaning the last element added to the stack will be the first one to be removed.