Skip to content

Latest commit

 

History

35 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 

Repository files navigation

SortingVisualizer

A visual representation of all the sorting algorithms.

I built this application because I was fascinated by sorting algorithms, and I wanted to visualize their working in action. It is reflective of how fast and effective each of these sorting algorithms are. I enjoyed building it. You can access it here SORTING VISUALIZER

About The Project

You can generate a new array with varied array size and then visualize these six sorting algorithms on it - Bubble, Selection, Insertion, Merge, Quick, Heap.

sorting-visualizer


In the image below, merge sort is currenlty applied to a randomly created array and currently we can see three coloured columns. What do they represent?

  • Yellow bars - When the algorithm is looking at particular bars at the moment, it is marked as yellow.
  • Red bars - If a particular bar is changing, it is marked as red.
  • Green bars - When the bar reaches it's final position where it is supposed to be, it is marked as green.

sorting-visualizer


Speed of the algorithm button allows us to see step by step how each algorithm works.

What I learnt!

  • Brushed up upon the concepts of HTML, CSS, Javascript
  • Brushed up upon my sorting algorithm concepts
  • Learnt about DOM Manipulation
  • Separation of concerns - Breaking the source code into different smaller blocks which are logically related(and putting in different files) so that it gets easier in spotting errors, debugging them and making changes in the code.

About

Visual representation of sorting algorithms

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages