Lecture : Data Structures and Algorithms for Beginners

7 views2 pages

Document Summary

In this video we talk about the basics of data structures and algorithms. We use the big o notation to describe the performance of an algorithm. This helps us determine if a given algorithm is scalable or not which basically means is this algorithm going to scale well as the input grows really large. Just because your code executes quickly on your computer does n"t mean it. "s gon na perform well when you give it a large data set. Using the big o notation to describe the performance of our algorithms we "re going to look at code snippets and use it to describe performance of algorithms. Over the next few videos we ""re going to talk about how scalable an algorithm is and finally knowing big l will make you a better developer or software engineer. An algorithm that runs in quadratic time is more efficient and more scalable than a linear algorithm.

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