Chapter 5

I- lkçN³TUeTA³
- Array KWCakarRbmUlpþúMénFatuEdlmanRbePTTinñn½ydUcKña .
- eKeRbI Array edIm,ICMnYsGefreRcIn EdlmanTinñn½yrYm .
- FatunimYy² eKGac Accesstamry³ Index rbs;va .
- Array CaRkum Memory location mYyEdlerobcMtamlMdab;lMedaytKña EdlFatuTI1pÞúkAddressedIm
ehIyFatucugeRkaypÞúk Adress cugeRkay .
II- Array mYyvimaRt³
1- Declaration :

datatype variableName[size];

- datatype : CaRbePTTinñn½y
- variableName : CaeQµaHén Array variable

- size : kMnt;BIcMnYnFaturbs; Array

cMnYnsrubKitCa Bytes én Array KW ³

total bytes=sizeof (datatyte) * number of elements
Edl 0 KWCa Index énFatuTI1rbs; Array
]TahrN¾³eKRbkas( Declare ) Array dUcxageRkam³
int A[10]; man 10 location )
(

double B[25]; (man 25 location)

int num[ ] = {12 , 7, 5 , 4 , 10}

12 7 5 4 10
num[0] num[1] num[2] num[3] num[4]

Edl num[0] = 12, num[1] =7 , num[2] =5 , num[3] = 4 , num[4] =10

int C[8] = { 0 }; man8 Locations mantMélesµIsUnüKW ³ C[0] = 0 , C[1] = 0 ,. . . . . . . , C[7] = 0

int d[10] = {12 , 7 , 5 , 4 };
 enaH d[0] = 12, d[1] = 7 , d[2] = 5 , d[3] =4 , d[4] =0 , d[5] = 0, . . . ., d[9] = 0
2- kar Access elI Array :
a- eKGaceFVIRbmaNviFIdUcGefrFmµtaEdr³
]TahrN¾³ x = num[1] + num[3] – num[0]
= 7 + 4 -12 = -1
num[2] = num[1] + num[3] = 7 + 4 = 11

b- Output:
eKeRbI Loop edIm,IsMEdgCa Index rbs; Array
]TahrN¾ : output FatunimYy²rbs; Array Edlman n Fatu³
int i , n , A[20] ;
for ( i = 0; i<n; i ++ )
printf(“A[%d] = %d\n”, i , A[i] );

c- Input:
eKbBa¢ÚltMéleGayFatunImYy²rbs Array Edlman n FatudUcxageRkam³
int i, n, A[42];
printf(“Input number of elements:” );
scanf(“%d”, &n );
for( i = 0 ; i<n ; ++i )
{
printf(“Input A[%d] = ”, i ) ;
scanf(“%d”, &A[i]);
}

]TahrN¾³ cUrsresr Program edIm,I Input FatunImYy²rbs; Array BI Keyboard ehIybnÞab;mk

Output FatuTaMgenaHelI Screen ?

#include<stdio.h>
#include<conio.h>
void main( ){
int n, i, a[50];
printf(“Input number of elements:” );
scanf(“%d”, &n );
for( i=0; i<n; i++ )
{
printf(“Input A[%d]= “, i );
scanf(“%d”, &a[i] );
}
for( i=0; i<n; i++ )
printf(“ A[%d]= %d “, i, a[i] );
 getch();
}
3- Array nig Function:
eKGaceRbI Array Ca Parameter rbs; FunctionEdlmanTMrg;Ca Reference parameter
edaymanEteQµaHén Array Kµan Index eT .
]TahrN¾TI1³cUrsresr Function edIm,IbBa©ÚltMéleGayFatunImYy²rbs; Array EdlmanFatu³
void Input( int n, int A[ ] )
{
for(int i=0; i<n; i++ ){
printf(“Input A[%d]= ”, i);
scanf(“%d”, &A[i] );
}
}
]TahrN¾TI2³cUrsresr Function edIm,IOutput FatunImYy²rbs; Array EdlmannFatu³
void Output( int n, int A[ ] )
{
for(int i=0; i<n; i++ )
printf(“ A[%d]= %d\n ”, i, a[i] );

]TahrN¾TI3³ cUrsresr Program edIm,I Input FatunImYy²rbs; Array BI Keyboard ehIybnÞab;mk

Output FatuTaMgenaHelI Screen edayeRbI Functon TaMgBIrxagelIenHmkGnuvtþ³
#include<stdio.h>
#include<conio.h>
void Input( int n, int x[ ] );
void Output( int n, int x[ ] );
void main( ){
int n, i, a[50];
printf(“Input number of elements:” );
scanf(“%d”, &n );
Input( n, a);
Output( n, a);
getch();
}
void Input( int n, int x[ ] ){
for(int i=0; i<n; i++ ){
printf(“Input x[%d]= ”, i);
scanf(“%d”, &x[i] );
}
}
void Output( int n, int x[ ] ){
for(int i=0; i<n; i++ )
printf(“ x[%d]= %d\n ”, i, x[i] );
 }
4- tMerobArray (sorting) :
tMerobKWCakarerobbNþaFaturbs; Array eTAtamlMdab;ekIn rW cuH . ]bmafa eyIgmanes‘rIénTinñn½y
¬cMnYnBit (float), cMnYnKt; (int)……) EdlCaFaturbs; Array . \LÚveyIgcg;erobFatuén Array
tamlMdab;ekInEdlkMnt;eday ³
dMbUgeRbobeFobFatuTI1 nigFatubnÞab; ebIvaFMCagenaHRtUvbþÚrTItaMgKña . eRbobeFobrebobenHrhUtdl;
FatuTI1 mantMéltUcbMput ehIynigFatubnþbnÞab;CatMélekIneLIg .
]TahrN¾TI1³ Pogram sMrab; Sort Faturbs; Array Edlman n FatutamlMdab;ekIn³
#include<stdio.h>
#include<conio.h>
void main(){
int i , j , n , t , a[40];
printf(“Input number of elements:” );
scanf(“%d”, &n );
for( i=0 ; i<n ; i++ ){
printf(“A[%d]= ”, i );
scanf(“%d”, &a[i] );
}
for( i=0; i<n-1; i++ )
for( j = i+1; ,j<n; j++)
if (a[i]>a[j] ) {
t = a[i]; a[i]= a[j]; a[j] =t;
}
printf(“after sorting:\n”);
for( i=0; i<n; i++)
printf(“%5d”, a[i] );
getch( ) ;
}
]TahrN¾TI2³ Pogram sMrab; Sort Faturbs; Array Edlman n FatutamlMdab;ekIn ( edaybegIát
Function mYysMrab; Sort Faturbs; Array )
#include<stdio.h>
#include<conio.h>
void sort( int n, int x[ ]);
void main(){
int i, n, a[40];
printf(“Input number of elements:” );
scanf(“%d”, &n );
for( i=0 ; i<n ; i++ ){
printf(“A[%d]= ”, i );
scanf(“%d”, &a[i] );
}
printf(“Before sorting:\n”);
 for( i=0; i<n; i++)
printf(“%5d”, a[i] );
sort(n, a );
printf(“after sorting:\n”);
for( i=0; i<n; i++)
printf(“%5d”, a[i] );
getch( ) ;
}
void sort( int n, int x[ ]){
int t, i, j ;
for( i=0; i<n-1; i++ )
for( j = i+1; ,j<n; j++)
if( x[i]>x[j] ) {
t = x[i]; x[i]= x[j]; x[j] =t;
}
}

5- Scarch :
SearchKWfaEsVgrkTinñn½yNamYykñúgcMeNames‘rIénTinñn½yTaMgLay . eKGac Scarch

tamviFIsaRsþ2y:agKW ³
Sequential Scarch nig Binary Search .
a- Sequential scarch :
CaviFIsaRsþmYyedayeRbobeFobTinñn½yEdlRtUv Search nwgFatunimYy²rbs; Array

BIFatuTI1rhUtdl;Fatucgu eRkay¦ RbsinebIrkeXIj¬Tinñn½yEdlRtUv ScarchesµIFatuén Array ¦

enaHbgðajecj(Output) nUvIndex énFatuenaH.
Function sMrab; Sequential search én Array mYYyEdlman n Fatu :
int seqSearch( int n, int a[ ] , int data ) {
Int i , index= -1 ;
for( i=0; i<n; i++)
If( data==a[i] ){
index = i ;
break;
}
return index;
}

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
int seqSearch( int n, int a[ ] , int data ) ;
void main( ) {
randomize( );
int I, n, b[40], datatoSearch, location ;
printf(“Input number of elements:” );
 scanf(“%d”, &n );
printf(“Elements of array :\n”);
for ( i=0; i<n; i++) {
b[i] = random(500);
printf(“%4d”, a[i]);
}
printf(input number to scarch:”);
scanf(“%d”, &datatoSearch);
location = seqSearch(n, b, datatoSeach );
If ( location = = -1) printf(“numbe is not in list:\n”);
else printf(“this number is index= %d”, location );
getch();
}

b- Binary Search :
CaviFIsaRsþénkar Search mYy EdlmanlkçN³RbesIrCag Sequential Search CaBiesscMeBaHTinñn½yFM
( Array EdlmaneRcInFatu ) . CaTUeTA Array man nFatu enaHSequential search Gac Search dl់eTA n dg

EtcMeBaH Binary Searchvij Gac Search RtwmEt kdg ( Edl k<n) .

munnwgGnuvtþ Binary Search enaHeKRtUv Sort Faturbs; Array Camunsin . karSearch edayeRbobeFob
Tinñn½y EdlRtUv Search eTAnwgFatukNþalén Array ebIesµIKñaenaHkar SearchRtUv)anbBa©b;
EtebIFMCagFatukNþal enaHTinñn½yEdlRtUv Search enAEpñkxagFMCag ¬FatukNþal¦én Array .
dMeNIrkarenHecHEtbnþrhUtdl; SearcheXIj rWk¾mineXIjdl;dMNak;kalcugeRkay .
]TahrN¾³ eKman Array mYyman10Fatu RtUv)aneK
SortrYcCaeRsc¬emIltaragxageRkam¦. ]bmafaeKcg;

Search rkFatuEdltMélesµI11kñúg Array xagelI . dMbUgeRbobeFobFatukNþal¬mantMél15¦RtUvnwg Index 5

eday 11<15 enaHTinñn½yEdlRtUvrk(11) enAEpñkxagtUcCagEdlman 5Fatu . bnÞab;mkeRCIserIs

FatukNþalbnþeTot
¬FatuRtUvnwg index 2 ¦ eday 11>9 enaHTinñn½yRtUv Search enAxagFM ( Edlman 2Fatu ) bnÞab;mkeRCIsFatu
kNþalbnþeTotEdlmantMélesµI 11 (RtUvnwgFatuEdlman Index 3 ) enaHFatuenHRtUvnwgtMélRtUv Search
dUcenH
Benary searchRtUv)anbBa©b;eday SearcheXIjenARtg;TItaMg Index 3 én Array .

kar SearchxagelIenH RbsinebIFatuT$I (Index TI#) esµI!@ vij enaHkarSearchrkmineXIjeLIy

eRBaHTinñn½y EdlRtUv Search Kµankñúg Faturbs; Array .
taragbgðajBIdMeNIrkar Binary Search :
 Index Array Comparison Result
0 3
1 4
2 9 2 Higher
3 11 3 Equal
4 13
5 15 1 Lower
6 21
7 31
8 55
9 60
Function sMrab; Binary Search :
int binSearch(int n, int a[ ] , int data )
{
int first , last , mid , index= -1 ;
first = 0; last = n-1;
while( first<=last ){
mid= (fist + last )/2;
If( data = = a[mid] ){
index=mid;
break;
}
else if( data>a[mid] ) first= mid+1;
else last=mid-1;
}
return index;
}

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
int binSearch( int n, int a[ ] , int data ) ;
void main( ) {
randomize( );
int I, n, b[40], datatoSearch, location ;
printf(“Input number of elements:” );
scanf(“%d”, &n );
printf(“Elements of array :\n”);
for ( i=0; i<n; i++) {
b[i] = random(500);
printf(“%4d”, a[i]);
}
printf(input number to scarch:”);
scanf(“%d”, &datatoSearch);
location = binSearch(n, b, datatoSeach );
If ( location = = -1) printf(“numbe is not in list:\n”);
else printf(“this number is index= %d”, location );
 getch();
}
III- Array BIrvimaRt³
1- TMrg;TUeTA³
eK Declare Array BIrvimaRtdUcxageRkam³
datatype name[2nd dim][1stdim];

Row column
]TahrN¾ : int A[3][4];
0 1 2 3
0 A[0,0] A[0,1] A[0,2] A[0,3]
1 A[1,0] A[1,1] A[1,2] A[1,3]
2 A[2,0] A[2,1] A[2,2] A[2,3]

2- kar Access elI Array BIrvimaRt:

a- Input:
eKeRbI for Loop BIredIm,IbBa©ÚltMéleGayFatu Array BIrvimaRt Edl Loop TI1sMEdgeGay Row ehIy
Loop TI2 sMEdgeGay Column . ]bmafa Array man 3 Rows nigman 4 Columns Edl Statement

enHkMnt;dUcxageRkam³
float num[3][4]; int i, j ;
for( i=0; i<3; ++I )
for( j=0; j<4; ++j )
{
printf(“Input num[%d][%d]= “, i, j );
scanf(“%f”, &num[i][j] );
}

b- Output:
eKeRbI for Loop BIredIm,I Output FatunImYy²rbs; Array BIrvimaRt Edl Loop TI1sMEdgeGay Row
ehIy Loop TI2 sMEdgeGay Column . ]bmafa Array man 3 Rows nigman 4 Columns Edl Statement
Output enH RtUv)ankMnt;dc
U xageRkam³
- Output CaTMrg;Fmµta³
float num[3][4]; int i, j ;
for( i=0; i<3; ++I )
for( j=0; j<4; ++j )
 printf(“num[%d][%d]= %0.2f “, i, j, num[i][j] );

- Output edaytMerobCaTMrg;ma:RTIs³
float num[3][4]; int i, j ;
for( i=0; i<3; ++I )
{
for( j=0; j<4; ++j )
printf(“ %8.2f “, num[i][j] );
printf(“ \n ”);
}

]TahrN¾³ Program edIm,IbBa©ÚltMéleGayFatunImYy²rbs; Array BIrvimaRtEdlman n Rows nig m

Columns .ehIybnÞab; mk Output FatuTaMgenaHelI Screen ( edaytMerobCaTMrg;ma:RTIs )

#include<stdio.h>
#include<conio.h>
void main(){
int i, j, n, m;
float num[15][18];
printf(“Input number of rows:” );
scanf(“%d”, &n );
printf(“Input number of columns:” );
scanf(“%d”, &m );
for( i=0; i<n; ++I )
for( j=0; j<m; ++j )
{
printf(“Input num[%d][%d]= “, i, j );
scanf(“%f”, &num[i][j] );
}
for( i=0; i<n; ++I )
{
for( j=0; j<m; ++j )
printf(“ %8.2f “, num[i][j] );
printf(“ \n ”);
}
getch();
}

eKGac Input nig Output FatunImYy²rbs; Array BIrvimaRtEdlsresrCa Function dUcxageRkam³

void inputArray2( int n, int m, float A[ ][ ] ){
int i, j ;
for( i=0; i<n; ++I )
for( j=0; j<m; ++j )
{
printf(“Input A[%d][%d]= “, i, j );
 scanf(“%f”, &A[i][j] );
}
}

void outputArray2( int n, int m, float A[ ][ ] ){

int i, j ;
for( i=0; i<n; ++I )
{
for( j=0; j<m; ++j )
printf(“ %8.2f “, A[i][j] );
printf(“ \n ”);
}
}

→ cMeBaH Program sMrab; Input nig Output FatunImYy²rbs; Array ( Edlman n rows nig m
columns ) edayyk Function TaMgBIrenHmkGnuvtþ.

#include<stdio.h>
#include<conio.h>
void inputArray2( int n, int m, float A[ ][ ] );
void outputArray2( int n, int m, float A[ ][ ] );
void main(){
int i, j, n, m;
float num[15][18];
printf(“Input number of rows:” );
scanf(“%d”, &n );
printf(“Input number of columns:” );
scanf(“%d”, &m );
inputArray2( n, m, num );
outputArray2( n, m, num );
getch();
}

c- eKGackMnt;tMél Initialize eGayFatunImYy²rbs; Array BIrvimaRt³

]TahrN¾³ int num[3][4] = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 } } ;
rW int num[3][4] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 } ;