Alex' Gardenアレックスの庭

Home

❯

5_Archive

❯

Other

❯

Uni

❯

Modules

❯

SS21

❯

‍ADP

❯

VL13 (1)

❯

Big O Notation

1 min read

Big-O Notation

= a notation to describe the ⚡️ Efficiency of an ⚙️ Algorithm using ᦛ Levels of complexity

Rules

  • ignore constants
  • only look at “worst case”
  • multiply loops on different levels, add on same

Graph View

  • Big-O Notation
  • Rules

Backlinks

  • ‍Algorithms, Datastructures, Programming Lectures