ALGORITHM

Introduction:   

Algorithm is a step-by-step process of solving a well-defined computational problem. 

In practice, in order to solve any complex real life problems, first we have to define the problem and then, design algorithm to solve it. Writing and executing a simple program may be easy; however, for executing a bigger one, each part of the program must be well organized. 

      In short, algorithms are used to simplify the program implementation. The next step is making the flowchart. It is a type of diagram that represents an algorithm or process, showing the steps as "boxes‟ of various kinds and their order by connecting them with arrows. Then, the flowchart will be converted into program code.

       An algorithm is an effective method expressed as a finite list of well defined

instructions for calculating a function, starting from an initial state and initial input. The instructions describe a computation, which will eventually produce output, when executed. We can use algorithm to solve any kind of problems. However, before writing a program, we need to write the steps to solve the problem in simple English language. 

This step-by-step procedure to solve the problem is called algorithm.

Example

Let us take one simple day-to-day example by writing algorithm for making "Maggi Noodles‟ as a food.

Step 1: Start

Step 2: Take pan with water

Step 3: Put pan on the burner

Step 4: Switch on the gas/burner

Step 5: Put magi and masala

Step 6: Give two minutes to boil

Step 7: Take off the pan

Step 8: Take out the magi with the help of fork/spoon

Step 9: Put the maggi on the plate and serve it

Step 10: Stop.

The way of execution of the program shall be categorized into three ways:       

(i) sequence statements; 

(ii) selection statements; and 

(iii) iteration or looping statements.

This is also called as "control structure‟.

(i) Sequence statements: In this program, all the instructions are executed one after another.

Example IN PYTHON PROGRAMMING

1. Write an algorithm to print „Good Morning‟.

Step 1: Start

Step 2: Print „Good Morning‟

Step 3: Stop

2. Write an algorithm to find area of a rectangle.

Step 1: Start

Step 2: Take length and breadth and store them as L and B

Step 3: Multiply by L and B and store it in area

Step 4: Print area

Step 5: Stop

In the above mentioned two examples , all the instructions are executed one after another. These examples are executed under sequential statement.

(ii) Selective Statements: In this program, some portion of the program is executed based upon the conditional test. If the conditional test is true, compiler will execute some part of the program, otherwise it will execute the other part of the program.

Example 1

Write an algorithm to check whether he is eligible to vote? (more than or equal to 18 years old).

Step 1: Start

Step 2: Take age and store it in age

Step 3: Check age value, if age >= 18 then go to step 4 else step 5

Step 4: Print “Eligible to vote” and go to step 6

Step 5: Print “Not eligible to vote”

Step 6: Stop

Example 2

Write an algorithm to check whether given number is +ve, -ve or zero.

Step 1: Start

Step 2: Take any number and store it in n.

Step 3: Check n value, if n > 0 then go to step 5 else go to step 4

Step 4: Check n value, if n < 0 then go to step 6 else go to step 7

Step 5: Print “Given number is +ve” and go to step 8

Step 6: Print “Given number is -ve” and go to step 8

Step 7: Print “Given number is zero”

Step 8: Stop

In the above mentioned examples  all the statements are not executed, but based upon the input, some portions of the algorithm are executed, because we have "true‟ or "false‟ situation in the program.

(iii) Iterative statements: In some programs, certain set of statements are executed again and again based upon conditional test. i.e. executed more than one time. This type of execution is called "looping or iteration‟.

Example

Write an algorithm to print all natural numbers up to "n‟.

Step 1: Start

Step 2: Take any number and store it in n.

Step 3: Store 1 in I

Step 4: Check I value, if I<=n then go to step 5 else go to step 8

Step 5: Print I

Step 6: Increment I value by 1

Step 5: Go to step 4

Step 8: Stop

In the above example, steps 4, 5, 6 and 7 are executed more than one time.

Flowchart

In the previous section of this chapter, we have learnt to write algorithms, i.e. step by step process of solving a problem. We can also show these steps in graphical form by using some symbols. This is called flowcharting.

Flowchart Symbols

Some of the standard symbols along with respective function(s) that are used for making flowchart are as follows:

Example-1

Draw a flowchart to find the simple interest. (Sequence)

Example-2

Draw a flowchart to find bigger number among two numbers (selective)

Example 3

Draw a flow chart to find factorial of any number.

Finite and Infinite loop

In looping statements, if some set of statements are executed "n‟ times (fixed number of times), then it is called "finite loop‟. At the same time, if some set of statements are executed again and again without any end (infinite times), then it is called "infinite loop‟. For example (X), if we are not incrementing "I‟ (index) value, then we will get endless (infinite) loop. The following is an example of infinite loop.

Example-4

Draw a flow chart to print the number from 1 to ∞.

for more details please view video:   Algorithm and Flowchart