Blog

Categories

Datastructures & Algorithms
  • Datastructures & Algorithms
  • IOS
  • JavaScript

Big O notation and Time Complexity

Datastructures & Algorithms

Whenever a question like: how long will this program take to finish? The closest we can get to a response is using Big O notation to calculate the program's time complexity. Due to many different variables ( like cpu, memory), it is incredibly hard to get an accurate measurement of how long a program will take. This is where Big O notation comes in.

View more