Arrays

Quick Sort is a sorting algorithm that uses a divide-and-conquer strategy to sort an array. It picks an element as a pivot, and partitions the array into two sub-arrays based on whether the elements are less than or greater than the pivot. Then it applys the same process to the two sub-arrays and repeats until the array is sorted.

Merge Sort is a sorting algorithm that uses a divide and conquer strategy to sort a list by repeatedly dividing it into smaller sublists

Bubble Sort is a sorting algorithm that

Binary Search is a sorting algorithm that

Insertion is a sorting algorithm that

Selection Sort is a sorting algorithm that

Two Pointer is a sorting algorithm that

Sliding Door is a sorting algorithm that

Dynamic Arrays is a sorting algorithm that