Scribd
Upload
3 views4 pages

Presentation 4

Gh

Uploaded by

beherahrushikesh92
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views4 pages

Presentation 4

Gh

Uploaded by

beherahrushikesh92
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Design and Analysis of Algorithms

• What is Design and Analysis of Algorithms?


An algorithm is a set of instructions to solve a problem by
performing calculations, data processing, or automating reasoning
tasks. However, there are always multiple solutions to solving a
problem. Design and Analysis of Algorithms provides various ways
to design e cient algorithms to solve a problem by analysing their
complexities.

• Why Analysis of Algorithms is important?


Algorithm analysis is an important part of computational
complexity theory. The complexity theory provides a theoretical
estimation for the required algorithm resources to solve a
computational problem. For instance, most algorithms are designed
to work with input data of variable length. Analysis of algorithms
determines the amount of time and space taken to execute such
algorithms.
ffi
Asymptotic Analysis
1. Best Case − Minimum time required for program execution.

2. Average Case − Average time required for program execution.

3. Worst Case − Maximum time required for program execution.

You might also like