Explore and visualize fundamental array operations and sorting algorithms through interactive demonstrations
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 repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Binary Search is a searching algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search space in half.
Insertion Sort is a sorting algorithm that builds the final sorted array one item at a time, by taking elements and placing them in their correct position.
Selection Sort is a sorting algorithm that repeatedly selects the smallest element from the unsorted portion and puts it at the beginning.
Two Pointer is an algorithm technique where two pointers iterate through a data structure, often moving independently at different speeds or directions.
Sliding Window is a computational technique that aims to reduce the use of nested loops and replace it with a single loop, reducing time complexity.
Dynamic Arrays automatically resize themselves when more storage is needed, understanding this data structure is crucial for efficient programming.
