Skip to content

Anindra123/SortingAlgorithmVisualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Sorting Algorithm Visualizer

A website to visualize various sorting algorithms of different time complexity. I always had an interest regarding algorithms and i wanted a way to visually represent them so i enjoyed a lot working on this project and finally complete it. There are six sorting algorithms that you can visualize here.

check out the complete project here : https://anindra123.github.io/SortingAlgorithmVisualizer

Algorithms

Bubble Sort

  • Best Case : Ω(n)

  • Average Case : Θ(n2)

  • Worst Case : O(n2)

Selection Sort

  • Best Case : Ω(n2)

  • Average Case : Θ(n2)

  • Worst Case : O(n2)

Insertion Sort

  • Best Case : Ω(n)

  • Average Case : Θ(n2)

  • Worst Case : O(n2)

Merge Sort

  • Best Case : Ω(n logn)

  • Average Case : Θ(n logn)

  • Worst Case : O(n logn)

Quick Sort

  • Best Case : Ω(n logn)

  • Average Case : Θ(n logn)

  • Worst Case : O(n2)

Heap Sort

  • Best Case : Ω(n logn)

  • Average Case : Θ(n logn)

  • Worst Case : O(n logn)