Sorting-Algorithms-Visualizer

  This is a simple visualizer for sorting algorithms.
  Right now it is able to simulate Bubble Sort, Quick Sort and Heap Sort.
  Every two columns that are swapped at a certain frame are coloured in green, the rest of the columns are coloured from lighter blue to darker blue,
depending on the value they represent.
  Once the whole array has been sorted, the program colours all the columns in green, starting from the smallest column (left) to the biggest one (right).

1. Bubble Sort, complexity O(n²)






2. Quick Sort, complexity of average case O(nlog₂n)






3. Heap Sort, complexity O(nlog₂n)

Controls:

• Esc for closing the application