Part 4 — Data Structures and Algorithms in Plain English | Time Complexities

  1. Execution time

What the Heck is Big O notation

  1. Constant Time Complexities → O(1)
  2. Linear Time Complexities → O(n)
  3. Logarithmic Time Complexities → O(log n)
  4. Quadratic Time Complexities → O(n²)
  5. Exponential Time Complexities → O(2^n)
  6. Factorial Time Complexities → O(n!)

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Loveday Perfection

Loveday Perfection

66 Followers

A Magician! Stay honest — Promote inclusion. Mixing magical potions @lighthouseweb3 @digitaleyesnft @kobo_360 @blacheinc | Building @cholatrek_tech