CSC165H1 Lecture 10: Week10-Toni

53 views28 pages
27 Mar 2018
School
Course
cherryberry1035 and 38883 others unlocked
CSC165H1 Full Course Notes
3
CSC165H1 Full Course Notes
Verified Note
3 documents

Document Summary

Next week prachce test on webpage out week ( cast one early next (hwy analysis of algorithms analysis of asymptotic functions. Hav to measure to of consider length n runtime have that algorithms. A- 2 a ] we have to show. { runtime ( x ) } a- cogcn) 8=1 . argue the for for loop so list of length n at most n times any executes is on. X runtime lxtn all n we have to show wq. cn ) gcn) S#rlyt#wccn) #) momformally. to#cn)eh f =n runtime ( x) a- cjgcn )) a- cogcn): gcn ) tnsno. We have to show: no , co a no co tn. T#bcgcn)eh(gcndf a- cogcn) ] fffxinn{ runtime ( x ) } tnsnobcqcn) = cogan): gcn ) anocotn, no , co. I to n check every whether number in the list. "icoert th > no tx wanttoshowwcnu. cnwcn. com# ( ) coin ] list of. Prove this all for inputs lists of length.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions