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

Deletion of any element from the circular queue, Algorithm for deletion of ... Algorithm for deletion of any element from the circular queue: Step-1: If queue is empty then say "queue is empty" & quit; else continue Step-2: Delete the "front" element

B-tree of degree 3, Q. Explain the result of inserting the keys given. ... Q. Explain the result of inserting the keys given. F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A, B, X, Y, D, Z, E  in an order to an empty B-tree of degree-3.

Binary codes, what is alphanumerical code what is alphanumerical code

How to measure the algorithm efficiency, How to measure the algorithm's eff... How to measure the algorithm's efficiency? It is logical to examine the algorithm's efficiency as a function of some parameter n showing the algorithm's input size. Instance

Implementation of queue by using a single linked list, Q. Perform implement... Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.

Perform breadth -first search, You are given two jugs, a 4-gallon one and a... 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

Double linked list, In a doubly linked list, also called as 2 way list, eac... In a doubly linked list, also called as 2 way list, each node is divided into 3 parts. The first part is called previous pointer field. It contains the address of the preceding

Convertion, how we can convert a graph into tree how we can convert a graph into tree

Two broad classes of collision resolution techniques, Two broad classes of ... Two broad classes of collision resolution techniques are A) open addressing and B) chaining

Hotel reservation system, pls i want a psuedo code for hotel reservation sy... pls i want a psuedo code for hotel reservation system.