Analyzing algoritms

[ducva]

• Random Access Memory model
• single statement with constant cost
• 2 important factors:
  • running time
    How many steps
  • input size
    • number of items in the input
    • number of bits needed to represent the input

[ducva]

order of growth or rate of growth

[ducva]

theta of n-squared