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

Objectives of lists, After going through this unit, you will be able to: ... After going through this unit, you will be able to: • define and declare Lists; • understand the terminology of Singly linked lists; • understand the terminology of Doubly

Depth first search, DEPTH FIRST SEARCH (DFS) The approach adopted into ... DEPTH FIRST SEARCH (DFS) The approach adopted into depth first search is to search deeper whenever possible. This algorithm frequently searches deeper through visiting unvisite

Describe commonly used asymptotic notations, Q.1 Compare two functions n 2 ... Q.1 Compare two functions n 2 and 2 n for various values of n. Determine when second becomes larger than first. Q.2 Why do we use asymptotic notation in the study of algorit

Explain the bubble sort algorithm, Explain the bubble sort algorithm. ... Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

Internal sorting, In internal sorting, all of the data to be sorted is obta... In internal sorting, all of the data to be sorted is obtainable in the high speed main memory of the computer. We will learn the methods of internal sorting which are following:

Relative and direct files, Each data record contains a fixed place in a rel... Each data record contains a fixed place in a relative file. Each record ought to have associated with it in integer key value which will help identify this slot. Therefore, this ke

High-level and bubble algorithm , 1. Give both a high-level algorithm and a... 1. Give both a high-level algorithm and an implementation (\bubble diagram") of a Turing machine for the language in Exercise 3.8 (b) on page 160. Use the ' notation to show the co

Write algorithm for post-order traversal, P os t - o r d e r T ... P os t - o r d e r T r av er sal :  This can be done by both iteratively and recursively. The iterative solution would require a modification or alteration of the in-

Explain multiplication method, Multiplication Method: The multiplication m... Multiplication Method: The multiplication method operates in 2 steps. In the 1ststep the key value K is multiplied by a constant A in the range O

Data structures, #quCreate a flowchart to show the process that will allow ... #quCreate a flowchart to show the process that will allow the implementation of Queue, Enqueue, and Dequeue operations.estion..