DMS Lecture Notes - Lecture 2: Big O Notation

5 views2 pages

Document Summary

We"ll talk a little bit about asymptotic notation. we talked about order. We have primarily 3 types of asymptic notation big o, big theta ( ) and big omega ( ) big o is represented by capital (o), which is in our english. When we do analysis of algorithms comparing any 2 algorithms then f ( n ) will be time and what is n , it "s input ok , size of input. G ( n) is your function which will come inside the big o. o ( n ) is anything can. Be algorithm it is g (n) that will be here and which is your algorithm. If you guys can find any such constant ( c ) and ( n ) - node , then f ( n) is o ( g ( n)" this is the mathematical definition of big o. If you ca n"t find it then its is not f (n ) is o.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions