09-03-2017, 10:17 PM

Quote:54. The recurrence: T(n) = T(n-1) + O(1) reduces to:This doesn't fit the form of the MRT, right? I'm pretty sure the answer is O(n) despite that. How should I approach reducing this though?

- O((log n)*(log n))

- O(n)

- O(log n)

- O(n log n)

UA ACM Vice President

ACM has bi-weekly meetings Tuesdays at 5:15pm

We're UA's best organization for CS majors (website)

Join us on Slack for all kinds of discussion channels (including one for CS403)

ACM has bi-weekly meetings Tuesdays at 5:15pm

We're UA's best organization for CS majors (website)

Join us on Slack for all kinds of discussion channels (including one for CS403)