title	type	duration	creator
Big-O	Lab	1:00	name city Charlie Drews NYC

Big-O Lab

Introduction

Note: This should be done independently.

In this lab, you will determine the time complexity of various algorithms in terms of their worst-case running times. You will express those running times in Big-O notation.

Exercise

Requirements

• For each of the four pseudocoded algorithms, determine the worst-case running time in Big-O notation
• Include an explanation of how you arrived at your answer

Bonus

• Perform the same analysis for the fifth algorithm

Starter code

In the starter code folder, you will find code for the four pseudocoded algorithms and the bonus.

Deliverable

Modify the pseudocode text file by adding the worse-case running time in Big-O notation and your explanation beneath each algorithm. Submit a pull request including your modified file. If you worked with a partner, put both names in the title of the pull request.

Additional Resources

• Best, Average, and Worst Cases

---

Licensing

1. All content is licensed under a CC­BY­NC­SA 4.0 license.
2. All software code is licensed under GNU GPLv3. For commercial use or alternative licensing, please contact [email protected].