What is Efficiency of algorithm?

Efficiency of an algorithm can be precisely explained and investigated with mathematical rigor.  There are two types of algorithm efficiency

i. Time Efficiency - Show how fast the algorithm runs

ii. Space Efficiency - Show how much extra memory the algorithm needs.

 

Posted Date: 7/27/2013 5:05:40 AM | Location : United States

Ask an Expert

Related Discussions:- What is efficiency of algorithm, Assignment Help, Ask Question on What is efficiency of algorithm, Get Answer, Expert's Help, What is efficiency of algorithm Discussions

Write discussion on What is efficiency of algorithm
Your posts are moderated

Write your message here..

Related Questions

Push and pop operations, Q. Explain that how do we implement two stacks in ... Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.

Sorted list followed by a few "random" elements, You have to sort a list L ... You have to sort a list L having of a sorted list followed by a few "random" elements. Which sorting methods would be especially suitable for this type of task?   Insertion sort

Life science, Define neotaxonomy. Discuss how electron microscopy can help ... Define neotaxonomy. Discuss how electron microscopy can help in solving a zoological problem faced by taxonomist.

Hash table, Programming for hash table? Programming for hash table?

Functions for inserting and deleting at either of the end, Q. Develop a rep... Q. Develop a representation for a list where insertions and deletions can be done at either end. Such a structure is known as a Deque (Double ended queue). Write functions for inse

Multiplication, Implement multiple stacks in a single dimensional array. Wr... Implement multiple stacks in a single dimensional array. Write algorithms for various stack operations for them.

Recursive implementation of binary tree traversals, There are three typical... There are three typical ways of recursively traversing a binary tree. In each of these, the left sub-trees & right sub-trees are visited recursively and the distinguishing feature

Binary search tree in ascending order, In order to get the contents of a Bi... In order to get the contents of a Binary search tree in ascending order, one has to traverse it in In-order

Applications of borazole, Ask question #Minimum 1cepted# Ask question #Minimum 1cepted#

Darw a flowchart to inputs top speeds of 5000 cars, Write an algorithm in t... Write an algorithm in the form of a flowchart that: inputs top speeds (in km/hr.) of 5000 cars Outputs fastest speed and the slowest speed Outputs average (mean) s