An array is a collection of similar data types stored in contiguous memory locations. Arrays allow storing multiple values in a single variable rather than declaring separate variables for each value. There are different ways to initialize and access array elements using indexes. Common array operations include traversing, searching, sorting, copying elements between arrays, and performing element-wise operations on multiple arrays. Popular searching techniques include linear search and binary search, while common sorting algorithms are bubble sort and selection sort.

1. ARRAYS

2. Arrays
An array is collection of elements of similar data type.
Why Arrays????
Arrays are used when there is a need to use many variables of
the same type. Say you want to store marks scored by 60 students of
our class in C programming subject, so how many variables you need
to declare to hold 60 values? 60 variables? Will it be feasible? So use
an array for the same task instead. The programmer has to just specify
the data type of elements and the number of elements that are
required as the size of the array.
60 variable’s declaration???
int s1,s2,s3,……..s60;
Or
int s[60] ;
Which is easy???

3. int a[5]; int a[5][5]; int a[5][5][5];

4. One Dimensional Array (1D Array)
Syntax for Declaring 1D Array
Example for Declaring 1D Array
int a[5];
Data_Type Array_Name[Size];
1004
1000 1008 1012 1016
a[1]
a[0] a[2] a[3] a[4]
a
Subscript or index, used to access the specific value from an array, a[3]
gives 40
Name of
the
array
Address of the array, in a
contiguous manner

5. Initializing 1D Array
1. Compile Time Initialization
Types of compile time array initialization:
 Complete array Initialization
 Partial array Initialization
 Initialization without size
 Initialization with Zero
2. Runtime Initialization

6. Compile Time Array Initializations
4. Initialization with Zero
3. Initialization without size
2. Partial Array Initialization
1. Complete array Initialization
1 2 3 4 5 1 2 3 0 0
1 2 3 4 5 0 0 0 0 0
a[1]
a[0] a[2] a[3] a[4]
a[1]
a[0] a[2] a[3] a[4]
a[1]
a[0] a[2] a[3] a[4]
a[1]
a[0] a[2] a[3] a[4]

7. Write a C Program to scan and print n array elements.

8. Write a C Program to scan n elements in an array and find the sum
and average of all the elements of the array & print the same

9. Write a C program to read marks scored by each student in C
programming subject in first internal exam, and calculate the average.

10. Write a C program to find the largest element in an array of n elements

11. Write a C program to find the largest and smallest element in an array of
n elements

12. 1 2 3 4 5
a[1]
a[0] a[2] a[3] a[4]
b[1]
b[0] b[2] b[3] b[4]
b[0] = a[0]
b[1] = a[1]
b[2] = a[2]
b[3] = a[3]
b[4] = a[4]
In general,
Write a C Program to copy the elements of one array to another array.
2
1 3 4 5
b[i] = a[i]
where i=0 to n-1
a
b

13. Write a C Program to copy the elements of one array to another array.

14. Write a C Program to perform element wise addition of two arrays a
and b in c.
1 2 3 4 5
a[1]
a[0] a[2] a[3] a[4]
6 7 8 9 10
b[1]
b[0] b[2] b[3] b[4]
7 9 11 13 15
c[1]
c[0] c[2] c[3] c[4]
c[0] = a[0]+b[0]
c[1] = a[1]+b[1]
c[2] = a[2]+b[2]
c[3] = a[3]+b[3]
c[4] = a[4]+b[4]
In general,
a
b
c
c[i] = a[i] + b[i]
where i=0 to n-1

16. Write a C Program to reverse the elements of an array of n elements.

17. Searching Techniques
Searching is an operation or a technique that helps to find a given element
or a value in the list of values. Any search is said to be successful or
unsuccessful depending upon whether the element that is being searched is
found or not.
Types of Searching Techniques
1. Linear Search
2. Binary Search

19. Write a C program to scan n array elements and perform linear search
for a given key element

20. Binary Search

21. Write a C program to scan n array elements and perform Binary search
for a given key element

22. Comparing Binary Search and Linear Search

23. Sorting Techniques
Sorting is the process of arranging the elements either in
ascending (or) descending order.
Types of Searching Techniques
1. Bubble Sort
2. Selection Sort

24. Bubble Sort
In Bubble sort, each element is compared with its adjacent element. If
the first element is bigger than the second one, then the positions of the
elements are interchanged. Otherwise it is not changed.
Then the next element is compared with its adjacent element and the
same process is repeated for all the elements in the array until we get a
sorted array.

25. Write a C Program to read n
arrays elements and sort the
elements of the array using
Bubble sort technique

26. Selection Sort
The selection sort algorithm sorts an
array by repeatedly finding the minimum
element (considering ascending order)
from unsorted part and putting it at the
beginning. The algorithm maintains two
sub arrays in a given array.
1) The sub array which is already sorted.
2) Remaining sub array which is unsorted.
In every iteration of selection sort, the
minimum element from the unsorted sub array
is picked and moved to the sorted sub array.

27. Write a C Program to read n arrays
elements and sort the elements of
the array using Selection sort
technique