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

Implementation of queue, For a queue a physical analogy is a line at bookin... For a queue a physical analogy is a line at booking counter. At booking counter, customers go to the rear (end) of the line & customers are attended to several services from the fr

Quicksort and bubble sort algorithms, Task If quicksort is so quick, w... Task If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms? Your

What do you understand by structured programming, What do you understand by... What do you understand by structured programming Structured Programming  This term is used for programming design that emphasizes:- (1) Hierarchical design of programmi

Operation of algorithm, Operation of Algorithm The following sequence o... Operation of Algorithm The following sequence of diagrams shows the operation of Dijkstra's Algorithm. The bold vertices show the vertex to which shortest path has been find ou

What is solid modeling, What is Solid modeling Solid modeling is the mo... What is Solid modeling Solid modeling is the most powerful of the 3-D modeling technique. It provides the user with complete information about the model. Defining an object wit

A Booth''s, Draw a flowchart of a Booth''s multiplication algorithm and exp... Draw a flowchart of a Booth''s multiplication algorithm and explain it.

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

A binary tree in which levels except possibly the last, A binary tree in wh... A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called as

Illustrate the varieties of arrays, Varieties of Arrays In some languag... Varieties of Arrays In some languages, size of an array should be established once and for all at program design time and can't change during execution. Such arrays are known a

Explain how two dimensional arrays are represented in memory, Explain how t... Explain how two dimensional arrays are represented in memory. Representation of two-dimensional arrays in memory:- Let grades be a 2-D array as grades [3][4]. The array will