• Visualizing Sorting Algorithms

It is exclusively based on binary Heap data structure. It involves finding the largest and sorting it to the end of an unsorted collection.

It is comparison-based algorithm which goes through entire collection(iterates) and compares two elements at a time. If the elements are out-of-order, it swaps them until the entire collection is sorted. After every iteration the highest values settles down at the end of the collection.

It uses Divide & Conquer, and chooses a pivot point in a collection of elements. It partitions the collection around the pivot, so that elements smaller then pivot are moved before it, larger elements are moved after it.

This is an comparison-based sorting algorithm. It maintains a sublist of the collection given already as "sorted sublist". It iterates through collection, one-by-one inserts elements into their correct spots in the sorted sublist.

It is Divide & Conquer algorithm, it divides the collection into 2 halves , and merges them in sorted manner to give sorted collection -- all of this, using RECURSION. Basic logic behind mergeSort - it tends to be a lot easier to 2 smaller list, rather then one large unsorted list.

  • Time Complexity :
  • Space Complexity :
  • stability :
  • Internal/External :
  • Recursive :
  • Comparsion :
Merge Sort
Insertion Sort
Quick Sort
Bubble Sort
Heap Sort