Computer Programming with C

1-17

Introduction to ‘C’

For example, the repetitive steps are as follows.

(i) To nd the rst ve Armstrong numbers from 1 to n, where n is the h Armstrong

number.

(ii) To nd the rst three palindrome numbers.

Based on the control transfer, the algorithms are categorized in the following three types.

(i) Deterministic: Deterministic algorithm is based on either to follow a ‘yes’ path or ‘no’ path

based on the condition. In this type of algorithm when control comes across a decision logic,

two paths ‘yes and ‘no’ are shown. Program control follows one of the routes depending upon

the condition.

Example:

Testing whether a number is even or odd. Testing whether a number is positive or negative.

(ii) Non-deterministic: In this ...