Arrays,

Searching & Sorting

Friday, September 8, 2023 1

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Arrays
 Arrays are defined to be a sequence/set of data elements of the
same type. Having an array, each array element can be accessed
by its position in the sequence of the array.
 Declaration of the Arrays: Any array declaration contains:
 the array name,

 the element type

 the array size and

 the dimension

 Examples:
 int a[20], b[3], c[7];

 float f[5][2], d[2];

 char m[4], n[20];

Friday, September 8, 2023 2

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Arrays
 Initialization of an array is the process of assigning initial
values. Typically declaration and initialization are combined.

 Examples:
 int a[4]={1, 3, 5, 2};
 float b[3]={2.0, 5.5, 3.14};
 char name[5]= {‘N’, ‘a’, ‘o’, ‘m’ , ‘i’};

Friday, September 8, 2023 3

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Example
 Write a program to calculate and print the average of the
following array of integers.
( 4, 3, 7, -1, 7, 2, 0, 4, 2, 13)

#include<stdio.h>
#define SIZE 10
int main() {
int x[10] = {4, 3, 7, -1, 7, 2, 0, 4, 2, 13};
int i, sum=0;
float av;
for(i=0, i<SIZE; i++)
sum = sum + x[i];
av = (float)sum / SIZE;
printf(“The average of the numbers = %.2f\n”, av);
return 0;
}
Friday, September 8, 2023 4
Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Sorting
 Sorting an array is the ordering the array elements in
 ascending (increasing: from min to max), or
 descending (decreasing: from max to min) order.

 Example:
 {2, 1, 5, 3, 2}  {1, 2, 2, 3, 5} ascending order
 {2, 1, 5, 3, 2}  {5, 3, 2, 2, 1} descending order

Friday, September 8, 2023 5

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Bubble Sort
 Smaller values in the list gradually “bubble” their way upward
to the top of the array.

 The technique makes several passes through the array. On

each pass successive pairs of elements are compared. If the
pair is in increasing order (or equal) the pair is unchanged. If a
pair is in descending order, their values are swapped in the
array.

Friday, September 8, 2023 6

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Bubble Sort

Pass = 1 Pass = 2 Pass = 3 Pass = 4

21532 12325 12235 12235
12532 12325 12235 12235
12532 12325 12235 12235
12352 12235 12235 12235
12325 12235 12235 12235

 Underlined pairs show the comparisons. For each pass there are
size-1 comparisons.
 Total number of comparisons = (size-1)2

Friday, September 8, 2023 7

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Bubble Sort

Pass = 1 Pass = 2 Pass = 3 Pass = 4

54321 43215 32145 21345
45321 34215 23145 12345
43521 32415 21345 12345
43251 32145 21345 12345
43215 32145 22345 12345

 Underlined pairs show the comparisons. For each pass there are
size-1 comparisons.
 Total number of comparisons = (size-1)2

Friday, September 8, 2023 8

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Bubble Sort : C Code
/* This program sorts the array elements in the ascending order*/

#include <stdio.h>
#define SIZE 5
void BubbleSort(int [ ]);
int main() {
int a[SIZE]= {2, 1, 5, 3, 2};
int i;
printf(“The elements of the array before sorting\n”);
for (i=0; i < SIZE; i++)
printf(“%4d”, a[i]);
BubbleSort(a);
printf(“\n\nThe elements of the array after sorting\n”);
for (i=0; i< SIZE; i++)
printf(“%4d”, a[i]);
return 0;
}
Friday, September 8, 2023 9
Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Bubble Sort : C Code

void BubbleSort(int A[ ]) {
int i, pass, temp;
for (pass=1; pass < SIZE; pass++)
for (i=0; i < SIZE-1; i++)
if(A[i] > A[i+1]){
temp = A[i];
A[i] = A[i+1];
A[i+1] = temp;
}
}

Friday, September 8, 2023 10

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Searching
 The process of finding a particular element in an array is
called searching. There two popular searching techniques:
 Linear search, and
 Binary search.
 The linear search compares each array element with the
search key.
 If the search key is a member of the array, typically the
location of the search key is reported to indicate the presence
of the search key in the array. Otherwise, a sentinel value is
reported to indicate the absence of the search key in the array.

Friday, September 8, 2023 11

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Linear Search
 Each member of the array is visited until the search key is
found.

 Example:
Write a program to search for the search key entered by the
user in the following array:
(9, 4, 5, 1, 7, 78, 22, 15, 96, 45)
You can use the linear search in this example.

Friday, September 8, 2023 12

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Linear Search
/* This program is an example of the Linear Search*/
#include <stdio.h>
#define SIZE 10
int LinearSearch(int [], int);
int main() {
int a[SIZE]= {9, 4, 5, 1, 7, 78, 22, 15, 96, 45};
int key, pos;
printf(“Enter the Search Key\n”);
scanf(“%d”, &key);
pos = LinearSearch(a, key);
if(pos == 1)
printf(“The search key is not in the array\n”);
else
printf(“The search key %d is at location %d\n”, key, pos);
return 0;
}

Friday, September 8, 2023 13

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Linear Search

int LinearSearch (int b[ ], int skey) {

int i;
for (i=0; i < SIZE; i++)
if(b[i] == skey)
return i;
return 1;
}

Friday, September 8, 2023 14

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Binary Search
 Given a sorted array, Binary Search algorithm can be used to
perform fast searching of a search key on the sorted array.
 The following program uses pointer notation to implement the
binary search algorithm for the search key entered by the user
in the following array:
(3, 5, 9, 11, 15, 17, 22, 25, 37, 68)

Friday, September 8, 2023 15

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Binary Search
#include <stdio.h>
#define SIZE 10
int BinarySearch(int [ ], int);
int main(){
int a[SIZE]= {3, 5, 9, 11, 15, 17, 22, 25, 37, 68};
int key, pos;
printf(“Enter the Search Key\n”);
scanf(“%d”,&key);
pos = BinarySearch(a, key);
if(pos == 1)
printf(“The search key is not in the array\n”);
else
printf(“The search key %d is at location %d\n”, key, pos);
return 0;
}

Friday, September 8, 2023 16

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Binary Search
int BinarySearch (int A[], int skey){
int low=0, high=SIZE1, middle;
while(low <= high){
middle = (low+high)/2;
if (skey == A[middle])
return middle;
else if(skey <A[middle])
high = middle  1;
else
low = middle + 1;
}
return 1;
}

Friday, September 8, 2023 17

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Computational Complexity
 The Computational Complexity of the Binary Search algorithm is
measured by the maximum (worst case) number of comparisons it
performs for searching operations.

The searched array is divided by 2 for each comparison/iteration.

Therefore, the maximum number of comparisons is measured by:
log2(n), where n is the size of the array.

 Example:
If a given sorted array 1024 elements, then the maximum number
of comparisons required is:
log2(1024) = 10 (only 10 comparisons is enough)

Friday, September 8, 2023 18

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET
 Computational Complexity
 Note that the Computational Complexity of the Linear Search is the
maximum number of comparisons you need to search the array. As
you are visiting all the array elements in the worst case, then, the
number of comparisons required is:
n (n is the size of the array)

 Example:
If a given an array of 1024 elements, then the maximum number of
comparisons required is:
n = 1024 (As many as 1024 comparisons may be required)

Friday, September 8, 2023 19

Dr. Md. Abul Kashem Mia, Professor, CSE Dept, BUET