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
Procedure-oriented programming (POP):- This is a top-down programming approach, where the problem is viewed as a sequence of tasks to be done such as calculating, printing etc. A n

Define the Parameter Passing Mechanism - Computer Programming? The Parameters are syntactically identifiers and they are used within the body of the function and sometimes the

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

Question: (a) How does HTML allow you to: (i) turn an image into a clickable hyperlink? Include code to switch off the default border (ii) convert the above hyperlink i

1. CMP and SUB CMP is used for comparing 2 registers by subtraction them from one another, but answer is not saved, whereas SUB subtracts 2 registers and saves the answer.

The standard way for debuggers to plant interactive breakpoints in a program in RAM (whatever the processor instruction set) is to save the break pointed instruction and replace it

How to read datasets in multiple text files in an non interactive program?

Use an insertion sort to sort an array (sequence) of long word integers. The size of the list will appear just before the list itself. Use the same labels as in this example: LE

Given a list of numbers, say my @input_numbers = (1, 1, 3, 5, 8, 13, 21, 34, 55, 89, 144); write a program map1.pl that will use the function map (a) to produce a list of

What is the switch Statement? This is a different form of the multi way decision that It is well structured, but can only be used in certain cases where: 1. Here, Only one var