Big O Notation Playground

About

I write this project to consolidate my knowledge about Big O Notation and play with python language.

To do

• Implement algorithms for notations:
  • O(n!)
  • O(2^n)
  • O(n log n)
• Plot graphics

Output Sample

--------------------------------------------------
Running algorithms...
--------------------------------------------------

Elements: 10
O(One) - Steps: 1  
O(LogN) - Steps:4
O(N) - Steps: 10   
O(NSquare) - Steps: 100

Elements: 100
O(One) - Steps: 2  
O(LogN) - Steps: 11
O(N) - Steps: 110  
O(NSquare) - Steps: 10100  

Elements: 250
O(One) - Steps: 3  
O(LogN) - Steps: 19
O(N) - Steps: 360  
O(NSquare) - Steps: 72600  

Elements: 500
O(One) - Steps: 4  
O(LogN) - Steps: 24
O(N) - Steps: 860  
O(NSquare) - Steps: 322600

Elements: 1000
O(One) - Steps: 5  
O(LogN) - Steps: 34
O(N) - Steps: 1860
O(NSquare) - Steps: 1322600

Elements: 2000
O(One) - Steps: 6  
O(LogN) - Steps: 43
O(N) - Steps: 3860
O(NSquare) - Steps: 5322600

Elements: 2500
O(One) - Steps: 7  
O(LogN) - Steps: 52
O(N) - Steps: 6360
O(NSquare) - Steps: 11572600   

Elements: 3000
O(One) - Steps: 8  
O(LogN) - Steps: 63
O(N) - Steps: 9360
O(NSquare) - Steps: 20572600   
--------------------------------------------------
--------------------------------------------------