by Dinesh Thakur Category: Data Structure

**Analysis of Algorithms (AofA) **is a field in computer science whose overall goal is an understanding of the complexity of algorithms. While an extremely large amount of research is devoted to worst-case evaluations, the focus in these pages is methods for average-case and probabilistic analysis. Properties of random strings, permutations, trees, and graphs are thus essential ingredients in the analysis of algorithms.

To **analyze an algorithm **is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the **efficiency **or **complexity **of an algorithm is stated as a function relating the input length to the number of steps (**time** **complexity**) or storage locations (**space complexity**).

Algorithm analysis is an important part of a broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm which solves a given computational problem. These estimates provide an insight into reasonable directions of search of efficient algorithms.

About Dinesh Thakur

Dinesh Thakur holds an B.SC (Computer Science), MCSE, MCDBA, CCNA, CCNP, A+, SCJP certifications. Dinesh authors the hugely popular Computer Notes blog. Where he writes how-to guides around Computer fundamental , computer software, Computer programming, and web apps. For any type of query or something that you think is missing, please feel free to Contact us.

Search Content

Popular Article

#### Define Algorithms with suitable example

#### What is data structure? List out the areas in which data structures are applied extensively

#### What is the difference between "calloc(...)" and "malloc(...)"

#### Is it better to use malloc() or calloc()

#### What are the various steps to plan Algorithm

#### How will you explain Record and Record Structure

#### What is difference between malloc()/free() and new/delete

#### What is the difference between realloc() and free()

#### You have two pairs : new() and delete() and another pair : alloc() and free(). Explain differences between eg. new() and malloc()

#### What is the Heap

#### What is the purpose of realloc( )

#### How can we analyse an Algorithm

#### What is abstraction?

#### Using free() Function in C

#### Memory Allocation Function Calloc()

Basic Courses

Advance Courses