Algorithm design
 | This article needs additional citations for verification. (May 2018) |
 | This article needs attention from an expert in Computer science. The specific problem is: the naivety of this article is astonishing, given the importance of the subject. (May 2018) |
Algorithm design is a specific method to create a mathematical process in problem solving processes. [citation needed] Applied algorithm design is algorithm engineering.
Algorithm design is identified and incorporated into many solution theories of operation research, such as dynamic programming and divide-and-conquer. Techniques for designing and implementing algorithm designs are algorithm design patterns,[1] such as template method pattern and decorator pattern, and uses of data structures, and name and sort lists.
One of the most important aspects of algorithm design is creating an algorithm that has an efficient runtime, also known as its Big O.
Steps in development of Algorithms
- Problem definition
- Development of a model
- Specification of algorithm
- Designing an algorithm
- Checking the correctness of algorithm
- Analysis of algorithm
- Implementation of algorithm
- Program testing
- Documentation preparation
Common design paradigms
Notes
- ^ Goodrich, Michael T.; Tamassia, Roberto (2002), Algorithm Design: Foundations, Analysis, and Internet Examples, John Wiley & Sons, Inc., ISBN 0-471-38365-1
Further reading
- Algorithm Design Paradigms - Overview by Paul Dunne at the University of Liverpool
- Stony Brook Algorithm Repository by Steven S. Skiena, Department of Computer Science, State University of New York
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |