Last updated Unknown

Status: Tags: #archivedCards/cmpt125/bigo Links: Big O Notation Calculating Time Complexity

Recurrence Relation

Decreasing Functions

#1

Big o notation ?

• Replace n=0 with n=1 for word problems
• Assume n-k = 1, n = k
  • T(n) = T(n-n-1) + n
  • Substitute T(1) for 1 from above

?

Dividing Functions

?

?

Backlinks

1

list from Recurrence Relation AND !outgoing(Recurrence Relation)

References:

Created:: 2021-10-23 15:43