Some topics of C programming Language is covered. Nested Loops, Multidimensional Arrays, Loop Control Statements and Linear Search is added.

1. Session 4
Complex Loops with Conditions
Tashreef Muhammad
39th Batch (Prototype 39), Dept. of CSE
Ahsanullah University of Science and Technology

2. Complex Loops with Conditions
1. Nested Loops
2. Multidimensional Arrays
3. Loop Control
4. Linear search
2
Tashreef Muhammad | CSE 39th Batch | AUST
29 Jan, 2021

3. Complex Loops with Conditions
● Loops inside loops
○ Allows to do more using loops
○ Many Applications
■ Multidimensional Array traversing
○ General Structure
■ Requires one loop control variable for each loop
■ Inner loop must finish before outer loop
3
Tashreef Muhammad | CSE 39th Batch | AUST
29 Jan, 2021
Nested Loops Multidimensional array Loop Control Linear Search
for(i = 0; i < n; ++i)
{
---
for(j = 0; j < m;
++j)
{
---
---
}
---
}

4. Complex Loops with Conditions
● Already learnt 1D Array
4
Tashreef Muhammad | CSE 39th Batch | AUST
29 Jan, 2021
Nested Loops Multidimensional Array Loop Control Linear Search
0 1 2 ….. n
X Axis

5. Complex Loops with Conditions
● Multidimensional Arrays
5
29 Jan, 2021
Nested Loops Multidimensional Array Loop Control Linear Search
0x0 0x1 ….. 0xm
1x0 1x1 ….. 1xm
.
.
.
…..
…..
…..
…..
…..
…..
…..
…..
…..
nx0 nx1 ….. nxm
Tashreef Muhammad | CSE 39th Batch | AUST
X Axis
Y
Axis
Row x Col

6. Complex Loops with Conditions
● Multidimensional Arrays
6
29 Jan, 2021
Nested Loops Multidimensional Array Loop Control Linear Search
Tashreef Muhammad | CSE 39th Batch | AUST
From Internet

7. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
7
Val of i:
Val of j:
What Should Be Printed:
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

8. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
8
Val of i:
Val of j:
What Should Be Printed:
0
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

9. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
9
Val of i:
Val of j:
What Should Be Printed:
0
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

10. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
10
Val of i:
Val of j:
What Should Be Printed:
0
0
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

11. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
11
Val of i:
Val of j:
What Should Be Printed:
0
0
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

12. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
12
Val of i:
Val of j:
What Should Be Printed:
21
0
0
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

13. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
13
Val of i:
Val of j:
What Should Be Printed:
21
0
0 1
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

14. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
14
Val of i:
Val of j:
What Should Be Printed:
21
0
0 1
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

15. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
15
Val of i:
Val of j:
What Should Be Printed:
21 75
0
0 1
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

16. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
16
Val of i:
Val of j:
What Should Be Printed:
21 75
0
0 1 2
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

17. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
17
Val of i:
Val of j:
What Should Be Printed:
21 75
0
0 1 2
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

18. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
18
Val of i:
Val of j:
What Should Be Printed:
21 75 81
0
0 1
0
0 1 2
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

19. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
19
Val of i:
Val of j:
What Should Be Printed:
21 75 81
0
0 1
0
0 1 2 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

20. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
20
Val of i:
Val of j:
What Should Be Printed:
21 75 81
0
0 1 2 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

21. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
21
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
0
0 1
0
0 1 2 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

22. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
22
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
0
0 1
0
0 1 2 3 4
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

23. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
23
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
0
0 1 2 3 4
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

24. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
24
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
0
0 1 2 3 4
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

25. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
25
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
0
0 1 2 3 4
1
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

26. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
26
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
0
0 1 2 3 4
1
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

27. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
27
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
0
0 1 2 3 4
1
0
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

28. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
28
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
0
0 1 2 3 4
1
0 1 2 3 4
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

29. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
29
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
0
0 1 2 3 4
1
0 1 2 3 4
2
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

30. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
30
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
0
0 1 2 3 4
1
0 1 2 3 4
2
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

31. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
31
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
50 26 77 19
0
0 1 2 3 4
1
0 1 2 3 4
2
0 1 2 3
4
0 1 2 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

32. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
32
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
50 26 77 19
0
0 1 2 3 4
1
0 1 2 3 4
2 3
4
4
0 1 2 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

33. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
33
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
50 26 77 19
0
0 1 2 3 4
1
0 1 2 3 4
2 3
4
4
0 1 2 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

34. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
34
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
50 26 77 19
47 21 27 30
0
0 1 2 3 4
1
0 1 2 3 4
2
0 1 2 3
4
0 1 2 3 4
4
0 1 2 3
3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

35. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
35
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
50 26 77 19
47 21 27 30
0
0 1 2 3 4
1
0 1 2 3 4
2 3
4
4
0 1 2 3
4
0 1 2 3
4
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

36. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
36
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
50 26 77 19
47 21 27 30
0
0 1 2 3 4
1
0 1 2 3 4
2 3
4
4
0 1 2 3
4
0 1 2 3
4
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

37. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
37
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
50 26 77 19
47 21 27 30
33 37 28 51
0
0 1 2 3 4
1
0 1 2 3 4
2
0 1 2 3
4
0 1 2 3 4
4
0 1 2 3
3
4
0 1 2 3
4
4
0 1 2 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

38. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
38
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
50 26 77 19
47 21 27 30
33 37 28 51
0
0 1 2 3 4
1
0 1 2 3 4
2 3
4
4
0 1 2 3
4
0 1 2 3
4 5
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
4
0 1 2 3

39. Traverse 2D Array with Nested Loops
#include <stdio.h>
int main(void)
{
int i, j, arr[5][4];
arr[5][4] = { { 21, 75, 81, 13 },
{ 38, 89, 14, 45 },
{ 50, 26, 77, 19 },
{ 47, 21, 27, 30 },
{ 33, 37, 28, 51 } };
for( i = 0; i < 5; ++i)
{
for(j = 0; j < 4; ++j)
{
printf(“%d “, arr[i][j]);
}
printf(“n”);
}
return 0;
}
39
Val of i:
Val of j:
What Should Be Printed:
21 75 81 13
38 89 14 45
50 26 77 19
47 21 27 30
33 37 28 51
0
0 1 2 3 4
1
0 1 2 3 4
2 3
4
4
0 1 2 3
4
0 1 2 3
4 5
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
4
0 1 2 3

40. Complex Loops with Conditions
● Character Array
○ 1D Array of Characters
○ Why Looking at it Specifically
■ Here comes strings!!!!
■ Strings are consecutive characters
■ Remember ASCII Characters taught in Session 1
40
29 Jan, 2021
Nested Loops Multidimensional Array Loop Control Linear Search
Tashreef Muhammad | CSE 39th Batch | AUST

41. Complex Loops with Conditions
● Character Array as Strings
○ Strings as character array
■ The null character: ‘0’
■ Turning Character arrays to string
○ <string.h> for Strings
■ Functions to manipulate string
41
29 Jan, 2021
Nested Loops Multidimensional Array Loop Control Linear Search
Tashreef Muhammad | CSE 39th Batch | AUST

42. Complex Loops with Conditions
● Functions for String Manipulation
○ gets() Taking Inputs
○ puts() Printing Outputs
○ strcmp() String Comparison
○ strlen() Length of String
○ strcat() String Concatenation
42
29 Jan, 2021
Nested Loops Multidimensional Array Loop Control Linear Search
Tashreef Muhammad | CSE 39th Batch | AUST

43. Complex Loops with Conditions
● Loop Control Statement
○ Continue
○ Break
● Combination of Loops with Conditions
○ Complex Loops
43
29 Jan, 2021
Nested Loops Multidimensional Array Loop Control Linear Search
Tashreef Muhammad | CSE 39th Batch | AUST

44. Traverse to Find Element in Array
44
Find : 14
Array : 56, 48, 26, 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
int ans = -1, arr[4] = {56, 48, 26, 3};
for(i = 0; i < 4; ++i)
{
if(arr[i] == 14)
{
ans = i;
break;
}
}
if(ans == -1)
printf(“Not Found”);
else
printf(“Found at index %d.”, ans);
56 48 26 3
i
:
ans
:
-1

45. Traverse to Find Element in Array
45
Find : 14
Array : 56, 48, 26, 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
int ans = -1, arr[4] = {56, 48, 26, 3};
for(i = 0; i < 4; ++i)
{
if(arr[i] == 14)
{
ans = i;
break;
}
}
if(ans == -1)
printf(“Not Found”);
else
printf(“Found at index %d.”, ans);
56 48 26 3
i
:
ans
:
-1
0

46. Traverse to Find Element in Array
46
Find : 14
Array : 56, 48, 26, 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
int ans = -1, arr[4] = {56, 48, 26, 3};
for(i = 0; i < 4; ++i)
{
if(arr[i] == 14)
{
ans = i;
break;
}
}
if(ans == -1)
printf(“Not Found”);
else
printf(“Found at index %d.”, ans);
56 48 26 3
i
:
ans
:
-1
1

47. Traverse to Find Element in Array
47
Find : 14
Array : 56, 48, 26, 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
int ans = -1, arr[4] = {56, 48, 26, 3};
for(i = 0; i < 4; ++i)
{
if(arr[i] == 14)
{
ans = i;
break;
}
}
if(ans == -1)
printf(“Not Found”);
else
printf(“Found at index %d.”, ans);
56 48 26 3
i
:
ans
:
-1
2

48. Traverse to Find Element in Array
48
Find : 14
Array : 56, 48, 26, 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
int ans = -1, arr[4] = {56, 48, 26, 3};
for(i = 0; i < 4; ++i)
{
if(arr[i] == 14)
{
ans = i;
break;
}
}
if(ans == -1)
printf(“Not Found”);
else
printf(“Found at index %d.”, ans);
56 48 26 3
i
:
ans
:
-1
3

49. Traverse to Find Element in Array
49
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

50. Traverse to Find Element in Array
50
Find : 26
Array : 56, 48, 26, 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
int ans = -1, arr[4] = {56, 48, 26, 3};
for(i = 0; i < 4; ++i)
{
if(arr[i] == 26)
{
ans = i;
break;
}
}
if(ans == -1)
printf(“Not Found”);
else
printf(“Found at index %d.”, ans);
56 48 26 3
i
:
ans
:
-1

51. Traverse to Find Element in Array
51
Find : 26
Array : 56, 48, 26, 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
int ans = -1, arr[4] = {56, 48, 26, 3};
for(i = 0; i < 4; ++i)
{
if(arr[i] == 26)
{
ans = i;
break;
}
}
if(ans == -1)
printf(“Not Found”);
else
printf(“Found at index %d.”, ans);
56 48 26 3
i
:
ans
:
-1
0

52. Traverse to Find Element in Array
52
Find : 48
Array : 56, 48, 26, 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
int ans = -1, arr[4] = {56, 48, 26, 3};
for(i = 0; i < 4; ++i)
{
if(arr[i] == 26)
{
ans = i;
break;
}
}
if(ans == -1)
printf(“Not Found”);
else
printf(“Found at index %d.”, ans);
56 48 26 3
i
:
ans
:
-1
1

53. Traverse to Find Element in Array
53
Find : 26
Array : 56, 48, 26, 3
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST
int ans = -1, arr[4] = {56, 48, 26, 3};
for(i = 0; i < 4; ++i)
{
if(arr[i] == 26)
{
ans = i;
break;
}
}
if(ans == -1)
printf(“Not Found”);
else
printf(“Found at index %d.”, ans);
56 48 26 3
i
:
ans
:
2
2

54. Traverse to Find Element in Array
54
29 Jan, 2021
Tashreef Muhammad | CSE 39th Batch | AUST

55. Complex Loops with Conditions
● Search Algorithm
○ Linear Search
○ Binary Search
● Linear Search
○ Using loops to search in array
55
29 Jan, 2021
Nested Loops Multidimensional Array Loop Control Linear Search
Tashreef Muhammad | CSE 39th Batch | AUST

56. Thank You
Welcoming Queries
56