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
how to learn about time complexity of a particular algorithm

Example 1:  Following are Simple sequence of statements Statement 1;  Statement 2; ... ... Statement k; The entire time can be found out through adding the times for

Write an algorithm for multiplication of two sparse matrices using Linked Lists.


If a node in a binary tree is not containing left or right child or it is a leaf node then that absence of child node can be represented by the null pointers. The space engaged by

Define the term counting - Pseudocode Counting in 1s is quite simple; use of statement count = count + 1 would enable counting to be done (for example in controlling a repeat

A B-tree of minimum degree t can maximum pointers in a node T pointers in a node.

Q. The reason bubble sort algorithm is inefficient is that it continues execution even after an array is sorted by performing unnecessary comparisons. Therefore, the number of comp


With the help of a program and a numerical example explain the Depth First Traversal of a tree.