Introduction to Algorithms/Efficiency

< 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

Completion status: this resource is a stub, which means that pretty much nothing has been done yet.

This article is issued from Wikiversity - version of the Saturday, May 31, 2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.