What is efficiency of algorithm, Data Structure & Algorithms

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







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
Related Questions
Explain binary search with an example

Q. Prove the hypothesis that "A tree having 'm' nodes has exactly (m-1) branches".      Ans: A tree having m number of nodes has exactly (m-1) branches Proof: A root

Define about the class invariant A class invariant may not be true during execution of a public operation though it should be true between executions of public operations. For

For splaying, three trees are maintained, the central, left & right sub trees. At first, the central subtree is the complete tree and left and right subtrees are empty. The target

Example of Area Subdivision Method The procedure will be explained with respect to an illustrative problem, with the image consisting of five objects, namely a triangle (T), qu

Optimal solution to the problem given below. Obtain the initial solution by VAM Ware houses Stores Availibility I II III IV A 5 1 3 3 34 B 3 3 5 4 15 C 6 4 4 3 12 D 4 –1 4 2 19 Re

Two linked lists are having information of the same type in ascending order. Write down a module to merge them to a single linked list that is sorted merge(struct node *p, stru

Beauty Salon is a system to be designed to manage the booking and the payment of a single beauty parlour. Beauty Therapists: A beauty parlour has a number of staff members mo

What will be depth do , of complete binary tree of n nodes, where nodes are labelled from 1 to n with root as node and last leaf node as node n

Illustrate an example of algorithm Consider that an algorithm is a sequence of steps, not a program. You might use the same algorithm in different programs, or express same alg