SOME PRE-REQUISITES AND Asymptotic Bounds ASYMPTOTIC BOUNDS INTRODUCTION

We have already mentioned that there may be more than one algorithms, that solve a
given problem. In Section 3.3, we shall discuss eight algorithms to sort a given list of
numbers, each algorithm having its own merits and demerits. Analysis of algorithms,
the basics of which we study in Unit 3, is an essential tool for making well-informed
decision in order to choose the most suitable algorithm, out of the available ones if
any, for the problem or application under consideration.



A number of mathematical and statistical tools, techniques and notations form an
essential part of the baggage for the analysis of algorithms. We discuss some of these
tools and techniques and introduce some notations in Section 2.2. However, for
detailed discussion of some of these topics, one should refer to the course material of
MCS-013

Also, in this unit, we will study a number of well-known approximation functions.
These approximation functions which calculate approximate values of quantities
under consideration, prove quite useful in many situations, where some of the
involved quantities are calculated just for comparison with each other. And the
correct result of comparisons of the quantities can be obtained even with approximate
values of the involved quantities. In such situations, the advantage is that the
approximate values may be calculated much more efficiently than can the actual
values.