Data Structures

This guide covers advanced algorithms, including sorting algorithms, search algorithms, and more.

Sorting Algorithms

Sorting algorithms are used to arrange data in a particular order.

Quick sort is a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays.

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

Search algorithms are designed to retrieve information stored within some data structure.

Binary search is a fast search algorithm with a time complexity of O(log n).