Skip to content

Latest commit

 

History

History
18 lines (13 loc) · 854 Bytes

README.md

File metadata and controls

18 lines (13 loc) · 854 Bytes

WizardHat

This repository is a mini-project for Data Structures 2 course at "Faculty of Engineering, Alexandria University". WizardHat includes implementations of some popular sorting techniques with visual representations for the sake of comparing between the speed of processing. The included techniques are:

  • Bubble sort
  • Heap sort
  • Insertion sort
  • Merge sort
  • Quick sort
  • Selection sort

Running time for applying different sorting techniques on a random set

WizardHat, also, provides a visualization for the sorting techniques mentioned above .

wizardSort

Used library: Processing