Define computational complexity
In this assignment, students will examine complexity theory and the effectiveness of algorithms.
Using the example within the “CYB-201 Assignment Guide,” located in the Course Materials, determine the complexity of the algorithm and cases in which the algorithm would/would not provide a reasonable approach for solving a problem.
Provide your reasoning in a presentation (PPT etc.) or article to novice practitioners so that they can understand a basic, solid, yet thorough complexity analysis. Make sure to address the following:
- Define computational complexity
- Provide 1-2 examples
- Discuss why it is an essential topic in algorithm development
- Discuss how you measure it
Provide a minimum of 2 references supporting your reasoning.
While APA style is not required for the body of this assignment, solid academic writing is expected, and documentation of sources should be presented using APA formatting guidelines, which can be found in the APA Style Guide, located in the Student Success Center.
This assignment uses a rubric. Please review the rubric prior to beginning the assignment to become familiar with the expectations for successful completion.
You are not required to submit this assignment to LopesWrite.