< Introduction to Algorithms
This is a lesson in in the course, Introduction to Algorithms, which is a part of The School of Computer Science
Objective |
Algorithm efficiency refers to making the steps of the algorithm concise and eliminating redundancy. This could include eliminating steps altogether by combining or deleting particular ones, or to refining a step to make it run with less code or run time, etc. |
Assignments |
|
This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.