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.

Google Online Preview   Download