SUBJECT : ADA

TOPIC : TO FIND THE SQUARE ROOT

OF A NUMBER BY NESTED METHOD
[CYCLE 5]
PRESENTED BY :
KEERTHI SHREE.S
MANU.P
1

SANDHYA.S[S2]
INTRODUCTION:

TABULATING METHOD IS ONE OF THE SIMPLE METHODS TO

FIND OUT THE ROOTS OF ANY QUADRATIC EQUATION

LET US CONSIDER AN EQUATION OF DEGREE2 SUCH AS, X2-

N=0.
F(X)=X2-N WHERE N=2
X 0 1 2 3 4 5 6

f(x) -28 -27 -24 -19 -12 -3 +8

2
THE VALUE OF THE UPPER LIMIT, THEN THE VALUE OF X GOES ON
INCREMENTING IN THE NEXT TABULATION.

X 5 5.1 5.2 5.3

f(x) -3 -1.98 -0.96 +0.09

THE LOWER VALUE OF X IS NEARER TO 0,HENCE THE ROOT IS

INCREMENTED BY THE NEXT ACCURATE VALUE 0.01.
3
HERE 5.30 GOT THE VALUE OF POSITIVE NUMBER. THUS
KIND OF ALGORITHM IS KNOWN AS BRUTE FORCE
ALGORITHM/ TABULATION ALGORITHM.
x F(x)
5.2 -0.96
5.21 -0.8559
5.22 -0.7516
5.23 -0.6471
5.24 -0.5424
5.25 -0.4375
5.26 -0.3324
5.27 -0.2271

4
5.28 -0.1216
5.29 -0.0159
5.30 +0.09
ALGORITHM DEVELOPMENT

INCREASE IN ACCURACY THE TIME ALSO INCREASES.

X0
∆1

GET NEXT X
X=X+∆
CHECK IF THE X, AN EXIT
IF YES XU=X
IF NO XL=X

5
2. +VE ROOT FOUND BY TABULATION:
INPUT : N ,∈
OUTPUT : ROOT
{
∆1
XL0 XXL
BACK BACK: X+XL
FL=X2-N
BACK : XX+∆
F=X2-N
IF | F |<Ɛ THEN {ROOTX,EXIT}
ELSE
IF(FL*F)>0 THEN {ROOTX,EXIT}
ELSE
(XLXL),XUX,(FLFL)
FUF,∆=∆/10
GO BACK BACK
}
6
 /* REDUCING THE B EQUATION BY THE SYNTHETIC DIVISION*/
STEP 1 .N=0
FOR I=0 TO 3
N=A[I]+(N*B[C])
A[I]=N
FOR END
IF(C=0)THEN
F(X)=A[0] X2+A[1]X+A[2]
ELSE
F(X)=A[0]X+A[1]
IF END
IF(C=2)THEN GO TO STEP 2
ELSE GO TO STEP 3
IF END
ALGORITHM ENDS
7
TIME COMPLEXITY:

THIS IS AN ITERATIVE ALGORITHM, WITH KNOWN UPPER

BOUND. THE ROOTS ARE FOUND FOR THE EQUATION
F(X)=0.THUS ACCORDING TO THE NUMERICAL ANALYSIS,
THE COMPLEXITY OF TIME CANNOT BE DETERMINED.
HENCE, FOR THE BEST CASE, THE TIME COMPLEXITY WILL
BE Ω(0)
TΩ∝0

THE ITERATION MAY BE DONE ANY NUMBER OF TIMES

WHICH CANNOT BE DETERMINED. HENCE THE TIME
COMPLEXITY FOR THE BEST CASE WOULD BE 0(∞)
T0∝∞. 8
BEST CASE : TΩ∝0

WORST CASE : T0∝∞.

THUS Ω(0)- 0(∞) IS THE SIMPLIFIED

NOTATION OF THE ALGORITHM.
9