Analysis of algorithms
Also known as
- Add other possible names for this topic
To analyze an algorithm is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or complexity of an algorithm is stated as a function relating the input length to the number of steps (time complexity) or storage locations (space complexity).
Algorithm analysis is an important part of a broader computational complexity theory, which provides theoretical estimates for...
full article at wikipedia
With the exception of Wikipedia summaries and some images the
content on this page is typically distributed under
the Creative Commons
Attribution license or Public Domain.
The original description for this topic was automatically generated from the Wikipedia article "Analysis of algorithms" licensed under the GNU Free Documentation License.
| Gallery | add an image |
There are no images for this topic yet.
Recent Discussions about Analysis of algorithms
There are no conversations on this topic. Would you like to start one?
Start the Discussion