This repository is part of the Udacity Data Structures & Algorithms Nanodegree program.
This project has 4 tasks to be completed.
- Implement an algorithm for each task.
- It should only print what the instructions require.
- Each task should be analyzed to determine the worst case time complexity of Big O.
In this project, we are not concerned with optimizing the code. Rather, the task is to analysis the implementation's time complexity.
In the analysis folder, I included a more detailed analysis including estimated time to execute the worst case.
The following documents were used for the time complexity analyzes: