0
What is the importance of analysis in the design of an algorithm?
Wiki User
∙ 14y ago
There are two main reasons we analyze an algorithm: correctness and efficiency.
By far the most important reason to analyze an algorithm is to make sure it will correctly solve your problem. If our algorithm doesn't work, nothing else matters. So we must analyze it to prove that it will always work as expected.
We must also look at the efficiency of our algorithm. If it solves our problem, but does so in O(nn) time (or space!), then we should probably look at a redesign.
Wiki User
∙ 14y ago
Add your answer:
Earn +20 pts
Design an algorithm to show the different operations on a stack?
Design an algorithm to show the different operations on a stack?
What is the criteria of algorithm analysis?
The term "analysis of algorithms" was coined by Donald Knuth. Algorithm analysis is an important part of a broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm which solves a given computational problem.
Design in terms of system design analysis?
system analysis and design
What is the design technique that programer use to breakdown algorithm into modules?
top-down design
System analysis and design by kendall 5th edition?
I need more about system analysis and design
Design and analysis of algorithm question bank?
hai this web site very useful senthil
What are the advantages of problem analysis and algorithm design?
Before execution a project should be planned. Problem analysis is a way of determining the foundation of a problem, so that the problem is better resolved. Algorithm design is very similar in that it uses mathematical process to determine and resolve computer Engineering issues.
Design an algorithm to show the different operations on degree?
Design an algorithm to show the different operation on the degree.
Design an algorithm to show the different operations on a stack?
Design an algorithm to show the different operations on a stack?
What is the criteria of algorithm analysis?
The term "analysis of algorithms" was coined by Donald Knuth. Algorithm analysis is an important part of a broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm which solves a given computational problem.
What do you mean by analysis of algorithm?
it is a processor of the work
Design in terms of system design analysis?
system analysis and design
Design step by steps algorithm on how to write the letter A and display the result?
Design step by steps algorithm on how to write the letter A and display the result
Design an algorithm for finding all the factors of positive integerfor example in the case of the integer 12your algorithm should report 12346 and 12?
design an algorithm for finding all the factors of a positive integer
What has the author Walter Goessens written?
Walter Goessens has written: 'An analysis of the first-fit binpacking-algorithm' 'An analysis of the next-fit binpacking-algorithm' 'An exact calculation of the expected waste for a bin-packing algorithm using items that are exponentially distributed'
What is the design technique that programer use to breakdown algorithm into modules?
top-down design
What is the worst case analysis for matrix multiplication algorithm?
n^3
