Introduction to Algorithms/Efficiency
Appearance
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]
|
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]
|
|