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
Q. How can we free the memory by using Boundary tag method in the context of Dynamic memory management?

Insertion & deletion of target key requires splaying of the tree. In case of insertion, the tree is splayed to find the target. If, target key is found out, then we have a duplicat

Q. An, array, A comprises of n unique integers from the range x to y(x and y inclusive where n=y-x). Which means, there is only one member that is not in A. Design an O(n) time alg

(a) Write (delay ) as a special form for (lambda () ) and (force ), as discussed in class. (b) Write (stream-cons x y) as a special form, as discussed in class. (c) Write

What is a height balanced tree? Height Balanced Tree (AVL Tree) An AVL tree is a binary search tree in which the height of the left and right subtree of the root vary by at most

By taking an appropriate example explain how a general tree can be represented as a Binary Tree.                                                                    C onversio

Linear search employee an exhaustive method of verified each element in the array against a key value. Whereas a match is found, the search halts. Will sorting the array before uti

Like general tree, binary trees are implemented through linked lists. A typical node in a Binary tree has a structure as follows struct NODE { struct NODE *leftchild; i

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Binary search tree. A binary search tree is a binary tree that is either empty or in which every node having a key that satisfies the following conditions: - All keys (if an