Chapter 3
Algorithms
Chapter 3 provides an exclusive study of algorithms. It discusses the basic notations used in the algorithms, various types of algorithms that exist and the performance analysis of algorithms. A detailed explanation regarding space complexity, apriori analysis and asymptotic notations is given. This chapter also elucidates the time complexity and worst, average and best case time complexities.
3.1 INTRODUCTION
An algorithm is a step-by-step process of solving a problem. It is a mathematical procedure or notation to represent the solution of a problem. It should be clear and unambiguous. Algorithm specifies the behaviour of the program to be implemented. It includes data structures used, comments on the usage of the data ...
Get Data Structures and Algorithms Using C++ now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
