Sorting Algorithms
Visualizer

Bubble sort is a simple algorithm for sorting integers or other objects. The procedure examines each group of neighboring items from left to right, swapping their locations if they are out of order. The algorithm repeats this until it finds no items to swap in the entire array.

Selection sort is an in-place comparison sorting algorithm. It divides the input array into a sorted and an unsorted region. It repeatedly selects the smallest element from the unsorted region and swaps it with the leftmost element in the unsorted region, expanding the sorted region by one element.

Quick sort is a highly efficient sorting algorithm and is based on the divide-and-conquer strategy. It works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. This process is repeated for the sub-arrays until the entire array is sorted.

Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. It works by iterating through the array, comparing each element with the previous elements, and moving the elements greater than the current element one position ahead.

Pathfinder is a tool or concept used to find the best path between two points, considering obstacles and constraints. It involves algorithms and techniques for efficient navigation or routing.