Queues and Unit Testing - Stanford University
Recap
Queues
More queues
Unit Testing
Conclusion
Queues and Unit Testing
Shreya Shankar
Stanford CS 106B
3 July 2018
Based on slides created by Ashley Taylor, Marty Stepp, Chris Gregg, Keith Schwarz, Julie Zelenski, Jerry Cain, Eric Roberts, Mehran Sahami, Stuart Reges, Cynthia Lee, and others. 1
Recap
Queues
More queues
Unit Testing
Conclusion
Recap
2
Recap
Queues
More queues
Unit Testing
Conclusion
Big O
? Idea: measures algorithmic efficiency ? How long does the program take to run?
? Algorithms are better if they take less time ? Number of statements in code can depend on how large the
input is ? we normally say the input size is N ? Only the biggest power of N matters ? To calculate big O, work from innermost indented code out
3
Recap
Queues
More queues
Unit Testing
Example
Q: What is the big O?
Vector v; for (int x = 1; x ................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
- basic python programming for loops and reading files
- linked lists csu
- chapter 8 bags and sets college of engineering
- python lists university of michigan
- linked data structures
- introduction to linked list review
- doubly linked lists mcgill university
- queues and unit testing stanford university
- positional list university of iowa
- a python book beginning python advanced python and
Related searches
- stanford university philosophy department
- stanford university plato
- stanford university encyclopedia of philosophy
- stanford university philosophy encyclopedia
- stanford university philosophy
- stanford university ein number
- stanford university master computer science
- stanford university graduate programs
- stanford university computer science ms
- stanford university phd programs
- stanford university phd in education
- stanford university online doctoral programs