BigFont Blog
  • Home
  • About
  • Bibliography (Work)

notes

A collection of 1 post

notes

Khan Academy: Asymptotic Notation

Asymptotic notation represents the rate-of-growth of the running time of an algorithm as the algorithm's input size n becomes large. To find asymptotic notation, we express the number of steps in an algorithm

  • Shaun Luttin
    Shaun Luttin
1 min read
BigFont Blog © 2021
Latest Posts Ghost