A visualization of 15+ sorting algorithms, including Quick Sort, Merge Sort, Selection Sort and more!

Merge Sort is a sorting algorithm based on the Divide et Impera technique, like Quick Sort. It can be implemented iteratively or recursively, using the Top-Down and Bottom-Up algorithms respectively.

Bubble Sort is an iterative sorting algorithm that imitates the movement of bubbles in sparkling water. The bubbles represents the elements of the data structure.

DESCRIPTION Quick Sort is a sorting algorithm based on splitting the data structure in smaller partitions and sort them recursively until the data structure is sorted.

It's a really simple and intuitive algorithm that does not require additional memory, but it's not really efficient on big data structures due to its quadratic time complexity. This algorithm has been …

Initially, the sorted sublist is made up of just one element and it gets progressively filled. For every iteration, the algorithm picks an element on the unsorted sublist and inserts it at the right place in the …

The data structure gets ordered to form the heap initially, and then it gets progressively reordered with an algorithm similar to Selection Sort, starting from the bigger elements.

Implement and visualize your sort algorithm using the JavaScript programming language. Write an asyncronous function that takes an Array of DOM element objects as a parameter and type the entry …

This algorithm is fast and easy to implement, but it's hard to measure its performances. Unlike Insertion Sort, Shell Sort starts by comparing the elements distant from each other by a certain gap that gets …

Gnome Sort is based on dividing the data structure in two sublists: a sorted one, and an unsorted one. For every cycle, the algorithm picks an element of the unsorted sublist and moves it with sequential …