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
The aim of this task is to gain experience in using the popular Web languages XSLT, XQuery, DTD, XML Schema and RDF. The Content: The University is organizing a stage show wh

NOTE: You will only submit the University.java and EmptyFileException.java files (inside P3.zip/tar) NOTE on null objects:. From Project 1: Since the array of students in the Cou


2. TEST & AND TEST is like CMP, it is used for conditional statement, and doesn’t save the answer. AND is logical multiplication. 3. INS & IN IN is used for data transfer from I/O

Problem 1 Explain the Booch Methodology 2 Why does every interaction diagram need a written description? Explain 3 Explain the five core workflows of the Unified Process

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

Area Under Curve Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve be

How and where to start to develop a preprocessor for java

You are required to develop a program that calculates the charges for DVD rentals, where current release cost RM3.50 and all others cost RM2.50. If a customer rents several DVDs, e

The reader-writer problem can be stated as follows: A shared memory location can be concurrently read by any number of tasks, but when a task must write to the shared memory locati