Introduction to Algorithms/Efficiency

From Wikiversity
Jump to navigation Jump to search

This is a lesson in in the course, Introduction to Algorithms, which is a part of The School of Computer Science

Objective[edit | edit source]

Books-aj.svg aj ashton 01f.png

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[edit | edit source]

Crystal Clear app kedit.svg

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