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
sir how can i explain deletion process in a data structure

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



Explain an efficient way of storing two symmetric matrices of the same order in memory. A n-square matrix array is said to be symmetric if a[j][k]=a[k][j] for all j and k. For

Which of the sorting algorithm is stable   Heap sorting is stable.

what is queues? how it work? and why it used? i want an assignment on queue .....

since the gregorian calendar was introduced in 1752,a leap year occurs every 4 years.you are to write a pseudo code to find out whether a year is a leap year.your progrm should dis

The above 3 cases are also considered conversely while the parent of Z is to the right of its own parent. All the different kind of cases can be illustrated through an instance. Le

Q. Explain various graph traversal schemes and write their advantages and disadvantages. A n s . Graph Traversal Scheme is explained below In many troubles we wish