A Sorting Algorithm is used to rearrange a given array or list of elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of elements in the respective data structure.
A linked list is a linear data structure where elements are stored in nodes, each containing data and a reference to the next node in the sequence.
A binary tree is a hierarchical data structure composed of nodes, where each node has at most two children—a left child and a right child.
A stack is a data structure that follows the Last-In-First-Out (LIFO) principle, where the most recently added item is the first one to be removed.
Binary Search is an efficient searching algorithm for sorted arrays with time complexity O(log n). Click to open the interactive visualizer 🚀