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. Execute your algorithm to convert the infix expression to the post fix expression with the given infix expression as input Q = [(A + B)/(C + D) ↑ (E / F)]+ (G + H)/ I

Determine the effect of Ruby in implementation of string Ruby has a String class whose instances are mutable sequences of Unicode characters. Symbol class instances are charact

Operations on B-Trees Given are various operations which can be performed on B-Trees: Search Create Insert B-Tree does effort to minimize disk access and t

Binary Search Tree let three types of traversals by its nodes. They are: Pre Order Traversal In Order Traversal Post Order Traversal In Pre Order Traversal, we ca

what is far and near procedures in system programming?

Representation of data structure in memory is known as: Abstract data type


Mid Square method with good example

how to define the size of array

Ans. An algorithm for the quick sort is as follows: void quicksort ( int a[ ], int lower, int upper ) { int i ; if ( upper > lower ) { i = split ( a, lower, up