Hello there and welcome

This little project serves to illustrate differences between various sorting algorithms.. and to improve my skills in python :)

• Implemented algorithms: bubbles, insertion, merge, quick, cocktail, counting, gnome, selection
  
• Algorithms to implement: timsort (default python for sorted function), double selection, radix, in place/out of place algorithms, heap sor, gravity (bead)
  
• Implemented structures: array (duh)
  
• Structures to implement: list, stack, queue, tree, heap, hashing
  

More things to do:

• Add stopwatch on the screen
• Add possibility to run multiple windows with different sorting algorithms, probably from same seed :)