Saturday, September 26, 2009

ARRAY ORDER REVERSAL

CONTENT


  • AIM

  • PROBLEM DESCRITION

  • ALGORITHM DISCRIPTION

  • IMPLIMENTATION

  • APPLICATION


AIM:

WE HAVE TO REVERSE THE NUMBERS IN THE PROBLEM GIVEN


PROBLEM DISCRIPTION


REVERSAL ORDER MEANS JUST REVERSE THE NUMBER. WE HAVE THE NUMBERS IN ORDER OF 1,2,3,4,5,6,7


MEANS THE REVERSE OF THE NUMBERS ARE 7,6,5,4,3,2,1.


WE TAKE THIS AS AN EXAMPLE.



1




2




3




4




5




6




7



N=7 WE HAVE TO INTIALISE THE VALUE OF I IS1.


R IS THE NUMBER OF SWAPING.


WE HAVE CALCULATE R VALUE R=N/2.


A [1] <=> A [7]


A [2] <=> A [6]


A [3] <=> A [5]


A [4] <=> A [4]


I=1 INCREASE THE VALUE. N IS DECREASE VALUE.


WE HAVE ACHIVE ONLY ONE VARIABLE USE BOTH RIGHT & LEFT SIDE.


SO THE FORMULA IS N=N-I+1.


N=7-1+1=7


N=7-2+1=6


N=7-3+1=5


N=7-4+1=4


N=7-5+1=3


N=7-6+1=2


N=7-7+1=1


ALGORITHM DESCRIPTION



READ THE VALUES


INITIALIZ THE I VALUE


FIND THE NO OF SWAP


SUBSTUTE THE FORMULA N=N-I+1.


COLECT THE VALUES AND STORED


STOP THE PROCESS.


IMPLEMENTATION:


#INCLUDE<STDIO.H>


#INCLUDE<CONIO.H>


VOID MAIN ( )


{


INT A [100], T, R, I, N;


PRINTF (“ENTER THE VALUES’);


SCANF (“%D”, &N);


FOR (I=0; I<=N; I++)


R=N/2;


FOR (I=0; I<=R;I++)


{


T=A [I];


A [I] = A [N-I+1];


A [N-I+1] =T;


}


FOR (I=1;I<=N;I++)


PRINTF (“%D “, &D [I]);


}


IF ARRAY IS STARTING WITH 0 TH INDEX IT IS NOT WORK.


N=8 WE HAVE TO INTIALISE THE VALUE OF I IS 0.


R IS THE NUMBER OF SWAPING.


WE HAVE CALCULATE R VALUE R= (N+1)/2.


A [0] <=> A [7]


A [1] <=> A [6]


A [2] <=> A [5]


A [3] <=> A [4]


I=0 INCREASE THE VALUE. N IS DECREASE VALUE.


WE HAVE ACHIVE ONLY ONE VARIABLE USES BOTH RIGHT & LEFT SIDE.


SO THE FORMULA IS N= N-I.


N=7-0=7


N=7-1=6


N=7-2=5


N=7-3=4


N=7-4=3


N=7-5=2


N=7-6=1


PROGRAM FOR STARTING INDEX 0:


#INCLIDE<STDIO.H>


#INCLUDE<CONIO.H>


VOID MAIN ( )


{


INT A [100], T, R,I,N;


PRINTF (“ENTER THE VALUES’);


SCANF (“%D”, &N);


FOR (I=0; I<=N; I++)


R=N/2;


FOR (I=0; I<=R; I++)


{


T=A [I];


A [I] = A [N-I];


A [N-I] =T;


}


FOR (I=1; I<=N; I++)


PRINTF (“%D “, &D [I]);


}


APPLICATION:


SORTING IN MATHEMATICAL.


MATRIX MALTIPLICATION


0 comments:

Post a Comment