Discuss about Algorithmic complexity and its types?

1.	Discuss about Algorithmic complexity and its types?
Answer» The complexity of an algorithm f(n) gives the running time and/or the storage space required by the algorithm in terms of n as the size of input data. Time Complexity: The Time complexity of an algorithm is given by the number of steps taken by the algorithm to complete the process. Space Complexity: Space complexity of an algorithm is the amount of memory required to run to its completion.

Answer»

The complexity of an algorithm f(n) gives the running time and/or the storage space required by the algorithm in terms of n as the size of input data.

Time Complexity:

The Time complexity of an algorithm is given by the number of steps taken by the algorithm to complete the process.

Space Complexity:

Space complexity of an algorithm is the amount of memory required to run to its completion.

Discussion

No Comment Found

Related InterviewSolutions

Discuss about Algorithmic complexity and its types?
Discuss about Linear search algorithm.?
List the characteristics of an algorithm?
What is searching? Write its types?
Which one of the following is not an Asymptotic notations?(a) Big(b) Big(c) Big Ω(d) Big ⊗
……… is called performance measurement.(a) A posteriori testing(b) A priori estimates(c) A preposition(d) A post preori
Which one of the following is a theoretical performance analysis of an algorithm?(a) A posteriori testing(b) A priori estimates(c) A preposition(d) A post preori
Explain the characteristics of an algorithm?
Write a note on Asymptotic notation?
How many asymptotic notations are used to represent time complexity of an algorithms?(a) 1(b) 2(c) 3(d) 4

Discuss about Algorithmic complexity and its types?

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment