Elementary Algorithmics

Introduction of Algorithms

What is Algorithms?

The statement or description in some notation, of this process is Algorithms. In other words, we can say that '' A algorithms is a description or statement of sequence of activities that constitutes a process of getting the desired output from the given inputs.

There are many definition we can find which came across the time since the introduction of Algorithms. Although, The word Algorithms derived from a Persian Mathematician Mohammed al-Khowarizmi who lived during ninth century A.D . The word 'al-khowarizmi' when written in Latin become 'Algorismus', from which 'algorithm' is a small step away.

Some other definitions of Algorithms are as follows:-

An algorithm, named after the ninth century scholar Abu Jafar Muhammad Ibn Musu Al-Khowarizmi, is defined as follows: Roughly speaking:

• An algorithm is a set of rules for carrying out calculation either by hand or on a machine.
• An algorithm is a finite step-by-step procedure to achieve a required result.
• An algorithm is a sequence of computational steps that transform the input into the output.
• An algorithm is a sequence of operations performed on data that have to be organized in data structures.
• An algorithm is an abstraction of a program to be executed on a physical machine (model of Computation).

The most famous algorithm in history dates well before the time of the ancient Greeks: this is the Euclid's algorithm for calculating the greatest common divisor of two integers. This theorem appeared as the solution to the Proposition II in the Book VII of Euclid's "Elements." Euclid's "Elements" consists of thirteen books, which contain a total number of 465 propositions.

Courtesy- http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/intro.htm

Algorithmic is a branch of computer science that consists of designing and analyzing computer algorithms.