Brandon Taft
Description: An interactive visualization of different sorting algorithms in computer science. Including a complete walkthrough of how the sorting algorithms work. The methods covered include quick sort, bubble sort, selection sort, insertion sort with more to be added.
data (5130) interactive (3474) tutorial (1639) visualization (970) algorithm (314) sort (62) quick sort (2) bubble sort (2) selection sort insertion sort
Insertion Sort is arguably the most intuitive sorting algorithm. It sorts exactly like you would when drawing cards from the top of a deck. While it does have a high time complexity, it is still considered a useful algorithm because it is very efficient with smaller lists.
Despite Selection Sort's inefficiency with large data sets, it works well with small lists. It sorts in-place, using no storage beyond what is needed for the original list. It takes the smallest number and places it at the front of the array. Then it takes the next smallest number and places it behind that one and repeats until the array is sorted.
Quick sort is a recursive algorithm that is commonly used due to its speed and efficiency. It is technically an in place sorting method that uses a divide and conquer method to divide the array at a specified pivot point into subarrays. It then recursively sorts the subarrays of these subarrays until the array is completely sorted.
Brandon Taft