DMS Lecture Notes - The Algorithm, Simple Algorithm, Time Point

5 views5 pages

Document Summary

To define an algorithm, to define the events in the life of an algorithm , we have , best case worst case and expected case. And along with that, i "ve packed one more thing into this video : If you watch this video till the end , then you will find out what this "log " really is. 9 and 24 are the numbers in it; they "re in ascending order , you can see for yourself. If you know even a bit of maths, you "ll know that it is in an ascending order. Now what i say is that i "ll give a number : "a" And i "d like you to tell me if this number exists within the array , or not. Sorry, your answer will be no , because it is n"t there. Your answer will algo 1 is a simple person. It does n"t have much of a brain.

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