Array Algorithms

Retrieves an element from an array using its index.

Repeatedly divide the sorted search space in half.

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

Remove an element from a specific index.

Find and remove the first occurrence of a specific value.

Remove the first element (index 0) of the array.

Remove the last element of the array.

Visits every element in the array from start to finish.

Insert an element at the start (index 0) of the array.

Insert an element at the end of the array.

Insert an element at a specific index.

Builds the final sorted array one item at a time.

Sequentially check each element until a match is found.

Directly accesses a random element in an array.

Visits elements within a specific start and end index range.

Visits every element in the array from finish to start.

Divides the input list into two parts: a sorted sublist and an unsorted sublist.

Directly access an element at a specific index.

Estimate the likely position of a target in uniformly distributed sorted data.

Search a sorted array by jumping fixed-size blocks before a local scan.

Shift all elements to the left, wrapping the first element to the end.

Divide the unsorted list into n sublists, then repeatedly merge sublists to produce new sorted sublists.

Combine two sorted arrays while preserving sorted order.

Pick a pivot and partition elements around it recursively.

Remove duplicate elements from an array.

Invert the order of all elements in the array.

Shift all elements to the right by k positions.

Replace the value stored at a specific array index.

Find matching values and update the selected occurrence.

Sort integer keys by counting frequencies and rebuilding order.

Sort by repeatedly extracting the root of a binary heap.

Sort numbers digit by digit using a stable sub-sort.