Number of Bars :
Sorting Speed :
Bubble sort is a comparison-based basic algorithm for arranging a string of numbers or other elements in an appropriate order. The method works by examining each set of adjacent elements in the string, from left to right, swapping their positions if they are out of order. This continues until it can run through the entire string and find no two elements that need to be swapped. Learn More
Amount :
Speed :
In selection sort, the first element in the list is chosen and it is compared repeatedly with all the remaining elements in the list. If any element smaller than the selected element (for Ascending order) is first encountered, then both are swapped so that first position is filled with the smallest element in the sorted order. Next, we select the element at a second position in the list and it is compared with all the remaining elements in the list. If any element is smaller than the selected element, then both are swapped. This algorithm is repeated until the entire array gets sorted. Learn More
Amount :
Speed :
In insertion sort, an array is virtually split into a sorted and an unsorted section. Values from the unsorted part are picked and placed at the correct position in the sorted part. Each element in the array is checked with the previous elements, resulting in a growing sorted output list. During each iteration, it selects an element from the unsorted portion and inserts it into the correct position within the sorted portion. The iteration continues until the whole list is sorted. Learn More
Amount :
Speed :
Quicksort algorithm follows divide-and-conquer method. In this case a pivot point is chosen from the array.Then the array is reordered so that all values smaller than the pivot are moved before it and all values larger than the pivot are moved after it, and those equalling it going either way. When this is done, the pivot move to it's final position. It functions recursively for each subarray of smaller values and also for the subarray with greater values. Learn More
Go to top👆