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

find shortest path from a to z using dijkstra''s algorithm., Q.  In the gi... Q.  In the given figure find the shortest path from A to Z using Dijkstra's Algorithm.    Ans: 1.  P=φ;  T={A,B,C,D,E,F,G,H,I,J,K,L,M,Z} Let L(A)

Perform depth -first search, You are given two jugs, a 4-gallon one and a 3... You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring marker on it. There is a tap that can be used to fill the jugs with water. How can you get exac

Computer arhitecture, The controversy of RISC versus CISC never ends. Suppo... The controversy of RISC versus CISC never ends. Suppose that you represent an advocate for the RISC approach; write at least a one-page critic of the CISC approach showing its disa

Postfix expression, : Write an algorithm to evaluate a postfix expression. ... : Write an algorithm to evaluate a postfix expression. Execute your algorithm using the following postfix expression as your input: a b + c d +*f ­ .

Explain about hubs, Hubs - In reality a multiport repeater - Connect... Hubs - In reality a multiport repeater - Connects stations in a physical star topology - As well may create multiple levels of hierarchy to remove length limitation of 10

Maximum degree of any vertex in a simple graph, The maximum degree of any v... The maximum degree of any vertex in a simple graph with n vertices is (n-1) is the maximum degree of the vertex in a simple graph.

Pseudocodes, how to draw a 5 inch square on the screen using * symbol how to draw a 5 inch square on the screen using * symbol

Shortest path dijkstras algorithm, * Initialise d & pi* for each vertex ... * Initialise d & pi* for each vertex v within V( g ) g.d[v] := infinity  g.pi[v] := nil g.d[s] := 0; * Set S to empty * S := { 0 }  Q := V(g) * While (V-S)

Graph, explain the prims''s algorithm with suitable example? explain the prims''s algorithm with suitable example?

Data flow diagrams, How to construct a data flow diagram for a college assi... How to construct a data flow diagram for a college assignment and marking systemA