Arrays

Visualize Insert, Delete, Update, and Search operations on dynamic arrays.

Simple comparison-based sorting algorithm.

Repeatedly finds the minimum element and puts it at the beginning.

Builds the sorted array one item at a time.

Efficient divide-and-conquer sorting algorithm.

Stable divide-and-conquer sorting algorithm.

Comparison-based sorting technique based on Binary Heap.

Integer sorting algorithm that counts number of objects.

Non-comparative integer sorting algorithm.

Distribution sort that scatters elements into buckets.

Generalization of insertion sort using gaps.

Sequentially checks each element of the list.

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

Searching in sorted arrays by jumping fixed steps.

Improved binary search for uniformly distributed data.

Find range where element is present, then binary search.

Use two pointers to iterate the array.

Efficiently find subarrays with specific properties.

Find the maximum sum contiguous subarray in O(n) time.

Precompute sums to allow O(1) range sum queries.

Sort an array of 0s, 1s, and 2s in one pass.