How do you find the complexity of an algorithm, Programming Languages

How do you get the complexity of an algorithm? What is the relation b/w the time & space complexities of an algorithm? Justify your answer with an example.
Posted Date: 7/7/2012 5:54:02 AM | Location : United States





Complexity of an algorithm is the measurement of analysis of complete algorithm. Analyzing an algorithm means predicting the resources where the algorithm needs such as memory, logic gates, communication bandwidth, and time. Most often this is computational time which is measured for getting a more suitable algorithm. It is known as time complexity of defined algorithm. The running time of a program is also described as a function of the size of its input. On a particular input, This is traditionally measured as the digit of primitive operations or steps executed.

The analysis of algorithm concerns on time complexity & space complexity. As compared to time analysis, the analysis of space need for an algorithm is usually easier, but wherever necessary, both these techniques are used. The space is concerned to as storage needed in addition to the space required storing the input data. The total amount of memory required by program to run to completion is concerned to as space complexity. For a given algorithm, time complexity mainly depends upon the size of the input, therefore, this is a function of input size ‘n’. And the amount of time required by an algorithm to run to its completion is referred as time complexity.

The best algorithm to solve a given programming problem is one which requires very less memory & takes very less time to execute. But in tradition it is not always likely to achieve both of these objectives. There can be more than one approach to solve a same problem. One such approach may need more space but mostly takes less time to complete its execution while the other approach requires less space but more time to complete its execution.
Posted by Rima | Posted Date: 7/7/2012 6:00:31 AM


Related Discussions:- How do you find the complexity of an algorithm, Assignment Help, Ask Question on How do you find the complexity of an algorithm, Get Answer, Expert's Help, How do you find the complexity of an algorithm Discussions

Write discussion on How do you find the complexity of an algorithm
Your posts are moderated
Related Questions
Question: (a) What do you understand by the term Postback? (b) Describe five benefits of creating virtual directories while developing an ASP.NET application. (c) Exp

1. Write out a detailed plan for a program to find the largest value in an array that is smaller than a ceiling C. For example, suppose the array has the values {4, 14, 11, 100, 6}

how do i make a bomber game using pascal on a software called lazuras

1- If the order of a (mod P) is 3, prove that the order of a+1 is 6. 2- Explain why the "simplifiled knapsack" code is not secure.

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

You are working for a cryptography department, where one of your jobs is to decipher intercepted messages that have been encrypted using a book cipher. The messages are sent by dif

In this assignment, you will design a program to perform the following task: Calculate the total price to purchase all the components required to build a state-of-the-art gaming c

How do i get back data from a FOR loop in order to print them on screen?

Vacation Envy - Travel and Photo Sharing Website Site Overview- Vacation Envy is a travel as well as photo-sharing site. Make your travel map, share photos and show off al

Implement the Prim's algorithm with array data structure as described in slide 12 of the file 04mst.ppt. Your program should have a runtime complexity of O(n2) and should be as eff