OBJECTIVES

After going through this Unit, you should be able to:

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.

ELEMEMTARY ALGORITHMICS SUMMARY

1. In this unit the following concepts have been formally or informally defined and discussed:

Problem, Solution of a Problem, Algorithm, Program, Process (all section 1.1) . Instance of a problem (Section 1.2)

OUTLINE OF ALGORITHMICS

We have already mentioned that not every problem has an algorithmic solution. The problem, which has at least one algorithmic solution, is called algorithmic or computable problem. Also, we should note that there is no systematic method (i.e., algorithm) for designing algorithms even for algorithmic problems.

PROBLEMS, AVAILABLE TOOLS & ALGORITHMS

In order to explain an important point in respect of the available tools, of which one must take care while designing an algorithm for a given problem, we consider some alternative algorithms for finding the product m*n of two natural numbers m and n.