Professional Documents
Culture Documents
Objective & Declaration
Objective & Declaration
datatpye array_name[array_size];
float cgpa[35];
int nums[5] = {23,56,78,12,98}; // with initialization
0 1 2 3 4 5 6 7 8 9
23 56 78 12 98 … … … … 75
nums[3] = 34;
n = nums[5];
scanf(“%d”, &nums[2]);
printf((“%d”, nums[4]);
C Programming Language Slides, Prepared by Dr. Rajesh Palit
Input and Output
int main(void)
{
int list[5];
int i;
for (i=0; i<5; i++) {
scanf(“%d”, &list[i]);
}
int main(void)
{
int list[5]= {12,34,56,78,90};
int i, sum = 0;
float avg;
for (i=0; i<5; i++) {
sum = sum + list[i];
}
avg = sum / 5.0;
printf(“%d %f\n”, sum, avg);
return 0;
}
int i, sum = 0;
float avg;
for (i=0; i<5; i++) {
sum = sum + list[i];
}
avg = sum / 5;
for (i=0; i<5; i++) {
if (list[i]>avg) printf(“%d ”, list[i]);
}
return 0;
}
int main(void)
{
int list[n]= {12,34,56,78,90};
int i,m = 0;
for (i=1; i<n; i++) {
if (list[i]>list[m]) m = i;
}
printf(“Largest Element: %d\n”, list[m]);
return 0;
}
scanf("%d", &item);
count = 0;
for (i=0; i<n; i++) {
if (nums[i]==item) {
count = count + 1;
}
}
if (count==0) printf("NOT Found\n");
else printf("Found: %d time(s).\n", count);
int main(void)
{
int list[n]= {12,34,56,78,90};
int i, p = 2;
for (i=p; i<n-1; i++) {
list[i] = list[i+1];
}
list[n-1] = -1; 12 34 56 78 90
return 0; 12 34 78 90 90
}
12 34 78 90 -1
int main(void)
{
int list[n]= {12,34,78,90,-1};
int i, p = 1, k = 17;
for (i=n-1; i>p; i--) {
list[i] = list[i-1];
}
list[p] = k;
12 34 78 90 -1
return 0;
} 12 34 34 78 90
12 17 34 78 90
C Programming Language Slides, Prepared by Dr. Rajesh Palit
Passing Array to a function
int cumulativeFreq(int a[], int z)
{
int i;
for (i=1;i<z; i++) {
a[i] = a[i] + a[i-1];
}
return 0; 3 7 4 8 11
}
3 10 14 22 33
[0][0] [0][1] [0][2] [0][3] [1][0] [1][1] [1][2] [1][3] [2][0] [2][1] [2][2] [2][3]
1 2 3 7 8
4 5 6 9 10
A => r1 X c1 11 12
B => r2 X c2
1 x 7 + 2 x 9 + 3 x 11 1 x 8 + 2 x 10 + 3 x 12
4 x 7 + 5 x 9 + 6 x 11 4 x 8 + 5 x 10 + 6 x 12
C => r1 X c2