What is algorithms optimality, Data Structure & Algorithms

What is algorithm's Optimality?

Optimality  is  about  the  complexity  of  the  problem  that  algorithm  solves.  What  is  the  minimum amount  of  effort  any  algorithm  will  require  to  exert  to  solve  the  problem  in   question  is  known as algorithm's Optimality.  

 

Posted Date: 7/27/2013 5:06:11 AM | Location : United States







Related Discussions:- What is algorithms optimality, Assignment Help, Ask Question on What is algorithms optimality, Get Answer, Expert's Help, What is algorithms optimality Discussions

Write discussion on What is algorithms optimality
Your posts are moderated
Related Questions
What do you mean by hash clash? Hashing is not perfect. Occasionally, a collision occurs when two different keys hash into the same hash value and are assigned to the same arra

Merging 4 sorted files having 50, 10, 25 and 15 records will take time

Best - Fit Method: - This method obtains the smallest free block whose  size is greater than or equal to get such a block by traversing the whole free list follows.


Draw a flowchart of a Booth''s multiplication algorithm and explain it.

Define Wire-frame Model This skeletal view is called a Wire-frame Model. Although not a realistic representation  of the object, it is still very useful in the early stages of

The space-complexity of the algorithm is a constant. It just needs space of three integers m, n and t. Thus, the space complexity is O(1). The time complexity based on the loop

Q. The system allocates the memory for any of the multidimensional array from a big single dimensional array. Describe two mapping schemes that help us to store the two dimensi

How sparse matrix stored in the memory of a computer?

Advantages of dry running a flowchart When dry running a flowchart it's advisable to draw up a trace table illustrating how variables change their values at every stage in the