algorithm vs

4
ALGORITHM VS. PSEUDO CODE Algorithm is a set of instructions or steps applied to a problem with a view to solve it. In simple words we can say that algorithm is method of solving a problem. Pseudo code describes algorithm itself. Pseudo code makes no use of syntax of a specified programming language. So, it cannot be executed in a computer. But it contains almost the same detail as a programming language does and has the same structure. ALGORITHM Algorithm is group of instructions or a set of steps applied to solve a problem. An easy example of algorithm is a recipe in a cook book. When a problem is solved with the help of a computer, some specific instructions have to be given to it. That is why the study of algorithm constitutes an integral part of the computer science. When algorithm is applied in a computer, a number of elementary operations are combined together. For example, to solve a complex mathematical problem, some simple operations like subtractions and additions are applied.

Upload: suneel-dogra

Post on 12-Jan-2015

55 views

Category:

Documents


1 download

DESCRIPTION

 

TRANSCRIPT

Page 1: Algorithm vs

ALGORITHM VS. PSEUDO CODE

Algorithm is a set of instructions or steps applied to a problem with a view to solve it.

In simple words we can say that algorithm is method of solving a problem. Pseudo

code describes algorithm itself. Pseudo code makes no use of syntax of a specified

programming language. So, it cannot be executed in a computer. But it contains

almost the same detail as a programming language does and has the same structure.

ALGORITHM

Algorithm is group of instructions or a set of steps applied to solve a problem. An

easy example of algorithm is a recipe in a cook book. When a problem is solved with

the help of a computer, some specific instructions have to be given to it. That is why

the study of algorithm constitutes an integral part of the computer science. When

algorithm is applied in a computer, a number of elementary operations are combined

together. For example, to solve a complex mathematical problem, some simple

operations like subtractions and additions are applied.

But applying algorithm to computer code is not so simple a matter. It is very tedious

task to convert an algorithm in assembly language. However, use of high level

languages like Java or C is much easier. The analysis of resources is required before

designing an algorithm. Generally, big O notation is used for performing time and

storage analysis. An algorithm is expressed with the help of natural languages,

flowcharts, and pseudo code.

PSEUDO CODE

Pseudo code is a method of representing algorithm. It has not a specific syntax to

write a language which is used in programming language. Therefore it cannot be

executed on a computer. A number of formats are available to write pseudo codes.

Page 2: Algorithm vs

They are mostly borrowed from the structures of popular languages like C, Lisp and

FORTRAN etc. When details are not important, they are expressed in natural

language. Algorithms are expressed in pseudo code as they are not understood by the

programmers who are familiar with other languages of programming. Pascal is

another language which is similar to pseudo code which makes the transformation of

pseudo code to the target program code easier. Control structures such as WHILE, IF-

THEN-ELSE, REPEAT-UTIL, FOR and CASE present in many high level languages

are allowed to include by Pseudo code

DIFFERENCE BETWEEN ALGORITHM AND PSEUDO CODE

As we have described, an algorithm is a set of instructions which provide solution to a

specific problem. A Pseudo code, on the other hand is a method used to define an

algorithm. An algorithm is written in a natural language while pseudo code can be

written in high level programming languages. But not a specified language syntax is

used in pseudo code. It, therefore, can be understood by the programmers acquainted

with different programming languages. Besides, transformation of an algorithm

written in pseudo code to programming code is easier than an algorithm written in

natural language.

PARADIGMS OF PROGRAMMING LANGUAGES

The term paradigm describes a set of techniques, methods, theories and standards that

together represent a way of thinking for problem solving. According to [Wegner,

1988], paradigms are “patterns of thought for problem solving”. Language paradigms

were associated with classes of languages. First the paradigms are defined. Thereafter,

programming languages according to the different paradigms are classified. The

language paradigms are divided into two parts: imperative and declarative paradigms

Page 3: Algorithm vs

as shown in the Figure 1. Imperative languages can be further as classified into

procedural and object-oriented approach. Declarative languages can classified into

functional languages and logical languages. In Figure 1, the examples of languages in

each category are also given.