Searching and Sorting 2

Searching and Sorting
Searching is used to find the location where an element is available. There are two
types of search techniques. They are:
1. Linear or sequential search

2. Binary search
Sorting allows an efficient arrangement of elements within a given data structure. It is

a way in which the elements are organized systematically for some purpose. For
example, a dictionary in which words is arranged in alphabetical order and telephone
director in which the subscriber names are listed in alphabetical order. There are many
sorting techniques out of which we study the following.
1. Bubble sort
2. Quick sort
3. Selection sort
4. Merge Sort
5. Insertion Sort
6. Radix Sort
There are two types of sorting techniques:
1. Internal sorting
2. External sorting
If all the elements to be sorted are present in the main memory then such sorting is
called internal sorting on the other hand, if some of the elements to be sorted are
kept on the secondary storage, it is called external sorting. Here we study only
internal sorting techniques.
Linear Search:
This is the simplest of all searching techniques. In this technique, an ordered or
unordered list will be searched one by one from the beginning until the desired element
is found. If the desired element is found in the list then the search is successful
otherwise unsuccessful.
Suppose there are n elements organized sequentially on a List. The number of

comparisons required to retrieve an element from the list, purely depends on where the
element is stored in the list. If it is the first element, one comparison will do; if it is
second element two comparisons are necessary and so on. On an average you need
[(n+1)/2] comparisons to search an element. If search is not successful, you would
need n comparisons.
The time complexity of linear search is O(n).
Dept. of C.S.E, K.S.R.M.C.E Page 1

Algorithm:
Let array a[n] stores n elements. Determine whether element x is present or not.
linsrch(a[n], x)
{
index = 0;
flag = 0;
while (index < n) do
{
if (x == a[index])
{
flag = 1;
break;
}
index ++;
}
if(flag == 1)
printf(Data found at %d position, index);
else
printf(data not found);
Example 1:
Suppose we have the following unsorted list: 45, 39, 8, 54, 77, 38, 24, 16, 4, 7, 9, 20
If we are searching for: 45, well look at 1 element before success 39,
well look at 2 elements before success 8,
well look at 5 elements before success 38
well look at 12 elements before success
For any element not in the list, well look at 12 elements before failure.
Example 2:
Let us illustrate linear search on the following 9 elements:
Index 0 1 2 3 4 5 6 7 8
Elements -15 -6 0 7 9 23 54 82 101
Searching different elements is as follows:

rd
1. Searching for x = 7Search successful, data found at 3 position.
th
2. Searching for x = 82Search successful, data found at 7 position.
3. Searching for x = 42Search un-successful, data not found.

A non-recursive program for Linear Search:
# include <stdio.h>
# include <conio.h>
main()
{
int number[25], n, data, i, flag = 0; clrscr();
printf("\n Enter the number of elements: "); scanf("%d",
&n);
printf("\n Enter the elements: "); for(i = 0; i <
n; i++)
scanf("%d", &number[i]);
printf("\n Enter the element to be Searched: "); scanf("%d",
&data);
for( i = 0; i < n; i++)
{
if(number[i] == data)
{
flag = 1; break;
}
}
if(flag == 1)
printf("\n Data found at location: %d", i+1);
else
printf("\n Data not found ");
}
A Recursive program for linear search:
# include <stdio.h>
# include <conio.h>
void linear_search(int a[], int data, int position, int n)

{
if(position < n)
{
if(a[position] == data)
printf("\n Data Found at %d ", position);
else
linear_search(a, data, position + 1, n);
}
else
printf("\n Data not found");
}
void main()
{
int a[25], i, n, data;
clrscr();
printf("\n Enter the number of elements: ");
scanf("%d", &n);
printf("\n Enter the elements:
"); for(i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}

printf("\n Enter the element to be seached: ");
scanf("%d", &data);
linear_search(a, data, 0, n);
getch();
}
BINARY SEARCH
If we have n records which have been ordered by keys so that x1 < x2 < < xn . When we
are given a element x, binary search is used to find the corresponding element from the
list. In case x is present, we have to determine a value j such that a[j] = x (successful
search). If x is not in the list then j is to set to zero (un successful search).
In Binary search we jump into the middle of the file, where we find key a[mid], and
compare x with a[mid]. If x = a[mid] then the desired record has been found. If x <
a[mid] then x must be in that portion of the file that precedes a[mid]. Similarly, if
a[mid] > x, then further search is only necessary in that part of the file which follows
a[mid].
If we use recursive procedure of finding the middle key a[mid] of the un-searched
portion of a file, then every un-successful comparison of x with a[mid] will eliminate
roughly half the un-searched portion from consideration.
Since the array size is roughly halved after each comparison between x and a[mid],
and since an array of length n can be halved only about log2n times before reaching a
trivial length, the worst case complexity of Binary search is about log 2n.
Algorithm:
Let array a[n] of elements in increasing order, n 0, determine whether x is present,

and if so, set j such that x = a[j] else return 0.
binsrch(a[], n, x)
{
low = 1; high = n;
while (low < high) do
{
mid = (low + high)/2 if
(x < a[mid])
high = mid 1;
else if (x > a[mid])
low = mid +
1; else return mid;
}
return 0;
}
low and high are integer variables such that each time through the loop either x is
found or low is increased by at least one or high is decreased by at least one. Thus we
have two sequences of integers approaching each other and eventually low will become
greater than high causing termination in a finite number of steps if x is not present.

Example 1:
Let us illustrate binary search on the following 12 elements:
Index 1 2 3 4 5 6 7 8 9 10 11 12
Elements 4 7 8 9 16 20 24 38 39 45 54 77
If we are searching for x = 4: (This needs 3 comparisons)

low = 1, high = 12, mid = 13/2 = 6, check 20
low = 1, high = 2, mid = 3/2 = 1, check 4, found




If we are searching for x = 20: (This needs 1 comparison)







The number of comparisons necessary by search element:
20 requires 1 comparison;
8 and 39 requires 2 comparisons;
4, 9, 24, 54 requires 3 comparisons and
7, 16, 38, 45, 77 requires 4 comparisons
Summing the comparisons, needed to find all twelve items and dividing by 12, yielding
37/12 or approximately 3.08 comparisons per successful search on the average.
Example 2:
Let us illustrate binary search on the following 9 elements:
Index 0 1 2 3 4 5 6 7 8
Elements -15 -6 0 7 9 23 54 82 101
Solution:
The number of comparisons required for searching different elements is as follows:
1. If we are searching for x = 101: (Number of comparisons = 4)

low high mid
1 9 5
6 9 7
8 9 8
9 9 9
found
2. Searching for x = 82: (Number of comparisons = 3)

low high mid
1 9 5
6 9 7
8 9 8
found
3. Searching for x = 42: (Number of comparisons = 4)

low high mid
1 9 5
6 9 7
6 6 6
7 6 not found

4. Searching for x = -14: (Number of comparisons = 3)
low high mid
1 9 5
1 4 2
1 1 1
2 1 not found
Continuing in this manner the number of element comparisons needed to find each of
nine elements is:
Index 1 2 3 4 5 6 7 8 9
Elements -15 -6 0 7 9 23 54 82 101
Comparisons 3 2 3 4 1 3 2 3 4
No element requires more than 4 comparisons to be found. Summing the comparisons

needed to find all nine items and dividing by 9, yielding 25/9 or approximately 2.77
comparisons per successful search on the average.
There are ten possible ways that an un-successful search may terminate depending
upon the value of x.
If x < a(1), a(1) < x < a(2), a(2) < x < a(3), a(5) < x < a(6), a(6) < x < a(7) or a(7)
< x < a(8) the algorithm requires 3 element comparisons to determine that x is not
present. For all of the remaining possibilities BINSRCH requires 4 element comparisons.
Thus the average number of element comparisons for an unsuccessful search is:
(3 + 3 + 3 + 4 + 4 + 3 + 3 + 3 + 4 + 4) / 10 = 34/10 = 3.4
Time Complexity:
The time complexity of binary search in a successful search is O(log n) and for an
unsuccessful search is O(log n).
A non-recursive program for binary search:
# include <stdio.h>
# include <conio.h>
main()
{
int number[25], n, data, i, flag = 0, low, high, mid; clrscr();
printf("\n Enter the number of elements: "); scanf("%d",
&n);
printf("\n Enter the elements in ascending order: "); for(i = 0; i <
n; i++)
scanf("%d", &number[i]);
printf("\n Enter the element to be searched: "); scanf("%d",
&data);
low = 0; high = n-1; while(low <=
high)
{
mid = (low + high)/2; if(number[mid]
== data)
{
flag = 1; break;
}

else
{
if(data < number[mid]) high = mid -
1;
else
low = mid + 1;
}
}
if(flag == 1)
printf("\n Data found at location: %d", mid + 1);
else
printf("\n Data Not Found ");
}
A recursive program for binary search:
# include <stdio.h>
# include <conio.h>
void bin_search(int a[], int data, int low, int high)

{
int mid ;
if( low <= high)
{
mid = (low + high)/2; if(a[mid] ==
data)
printf("\n Element found at location: %d ", mid + 1);
else
{
if(data < a[mid])
bin_search(a, data, low, mid-1);
else
bin_search(a, data, mid+1, high);

}
}
else
printf("\n Element not found");
}
void main()
{
int a[25], i, n, data;
clrscr();
scanf("%d", &n);
printf("\n Enter the elements in ascending order: ");
for(i = 0; i < n; i++)
scanf("%d", &a[i]);
printf("\n Enter the element to be searched: ");
scanf("%d", &data);
bin_search(a, data, 0, n-1);
getch();
}

BUBBLE SORT
The bubble sort is easy to understand and program. The basic idea of bubble sort is to
pass through the file sequentially several times. In each pass, we compare each
element in the file with its successor i.e., X[i] with X[i+1] and interchange two element
when they are not in proper order. We will illustrate this sorting technique by taking a
specific example. Bubble sort is also called as exchange sort.
Example:
Consider the array x[n] which is stored in memory as shown below:
X[0] X[1] X[2] X[3] X[4] X[5]

33 44 22 11 66 55
Suppose we want our array to be stored in ascending order. Then we pass through the
array 5 times as described below:
Pass 1: (first element is compared with all other elements).
We compare X[i] and X[i+1] for i = 0, 1, 2, 3, and 4, and interchange X[i] and X[i+1] if
X[i] > X[i+1]. The process is shown below:
X[0] X[1] X[2] X[3] X[4] X[5] Remarks

33 44 22 11 66 55
22 44
11 44
44 66
55 66
33 22 11 44 55 66
The biggest number 66 is moved to (bubbled up) the right most position in the array.
Pass 2: (second element is compared).
We repeat the same process, but this time we dont include X[5] into our comparisons.
i.e., we compare X[i] with X[i+1] for i=0, 1, 2, and 3 and interchange X[i] and X[i+1] if
X[i] > X[i+1]. The process is shown below:
X[0] X[1] X[2] X[3] X[4] Remarks
33 22 11 44 55
22 33
11 33
33 44
44 55
22 11 33 44 55
The second biggest number 55 is moved now to X[4].

Pass 3: (third element is compared).
We repeat the same process, but this time we leave both X[4] and X[5]. By doing this,
we move the third biggest number 44 to X[3].
X[0] X[1] X[2] X[3] Remarks
22 11 33 44
11 22
22 33
33 44
11 22 33 44
Pass 4: (fourth element is compared).
We repeat the process leaving X[3], X[4], and X[5]. By doing this, we move the fourth
biggest number 33 to X[2].
X[0] X[1] X[2] Remarks
11 22 33
11 22
22 33
Pass 5: (fifth element is compared).
We repeat the process leaving X[2], X[3], X[4], and X[5]. By doing this, we move the
fifth biggest number 22 to X[1]. At this time, we will have the smallest number 11 in
X[0]. Thus, we see that we can sort the array of size 6 in 5 passes.
For an array of size n, we required (n-1) passes.
Program for Bubble Sort
#include <stdio.h>
#include <conio.h>
void bubblesort(int x[], int n)
{
int i, j, temp;
for (i = 0; i < n; i++)
{
for (j = 0; j < ni-1 ; j++)
{
if (x[j] > x[j+1])
{
temp = x[j];
x[j] = x[j+1];
x[j+1] = temp;
}
}
}
}

main()
{
int i, n, x[25];
clrscr();
scanf("%d", &n);
printf("\n Enter Data:");
for(i = 0; i < n ; i++)
scanf("%d", &x[i]);
bubblesort(x, n);
printf ("\n Array Elements after sorting: ");
for (i = 0; i < n; i++)
printf ("%5d", x[i]);
}
Time Complexity:
The bubble sort method of sorting an array of size n requires (n-1) passes and (n-1)
2
comparisons on each pass. Thus the total number of comparisons is (n-1) * (n-1) = n
2
2n + 1, which is O(n ). Therefore bubble sort is very inefficient when there are more
elements to sorting.
SELECTION SORT
Selection sort will not require no more than n-1 interchanges. Suppose x is an array of
size n stored in memory. The selection sort algorithm first selects the smallest element
in the array x and place it at array position 0; then it selects the next smallest element
in the array x and place it at array position 1. It simply continues this procedure until it
places the biggest element in the last position of the array.
The array is passed through (n-1) times and the smallest element is placed in its
respective position in the array as detailed below:
Pass 1: Find the location j of the smallest element in the array x [0], x[1], . . . . x[n-1],
and then interchange x[j] with x[0]. Then x[0] is sorted.
Pass 2: Leave the first element and find the location j of the smallest element in the
sub-array x[1], x[2], . . . . x[n-1], and then interchange x[1] with x[j]. Then
x[0], x[1] are sorted.
Pass 3: Leave the first two elements and find the location j of the smallest element in
the sub-array x[2], x[3], . . . . x[n-1], and then interchange x[2] with x[j].
Then x[0], x[1], x[2] are sorted.
Pass (n-1): Find the location j of the smaller of the elements x[n-2] and x[n-1], and
then interchange x[j] and x[n-2]. Then x[0], x[1], . . . . x[n-2] are sorted. Of
course, during this pass x[n-1] will be the biggest element and so the entire
array is sorted.
Time Complexity:
In general we prefer selection sort in case where the insertion sort or the bubble sort
requires exclusive swapping. In spite of superiority of the selection sort over bubble
sort and the insertion sort (there is significant decrease in run time), its efficiency is
2
also O(n ) for n data items.

Example:
Let us consider the following example with 9 elements to analyze selection Sort:
1 2 3 4 5 6 7 8 9 Remarks
65 70 75 80 50 60 55 85 45 find the first smallest element
i j swap a[i] & a[j]
45 70 75 80 50 60 55 85 65 find the second smallest element
i j swap a[i] and a[j]
45 50 75 80 70 60 55 85 65 Find the third smallest element
45 50 55 80 70 60 75 85 65 Find the fourth smallest element
45 50 55 60 70 80 75 85 65 Find the fifth smallest element
45 50 55 60 65 80 75 85 70 Find the sixth smallest element
45 50 55 60 65 70 75 85 80 Find the seventh smallest element
45 50 55 60 65 70 75 85 80 Find the eighth smallest element
i J swap a[i] and a[j]
45 50 55 60 65 70 75 80 85 The outer loop ends.
Non-recursive Program for selection sort
# include<stdio.h>
# include<conio.h>
void selectionSort( int low, int high );
int a[25];
int main()
{
int num, i= 0; clrscr();
printf( "Enter the number of elements: " ); scanf("%d", &num);
printf( "\nEnter the elements:\n" ); for(i=0; i < num; i++)
scanf( "%d", &a[i] ); selectionSort( 0, num - 1
);
printf( "\nThe elements after sorting are: " ); for( i=0; i< num; i++ )
printf( "%d ", a[i] ); return 0;
}
void selectionSort( int low, int high )

{
int i=0, j=0, temp=0, minindex; for( i=low; i <= high; i++ )
{
minindex = i;

for( j=i+1; j <= high; j++ )
{
if( a[j] < a[minindex] ) minindex = j;
}
temp = a[i];
a[i] = a[minindex]; a[minindex] = temp;
}
}
Recursive Program for selection sort
#include <stdio.h> #include<conio.h>
int x[6] = {77, 33, 44, 11, 66}; selectionSort(int);
main()
{
int i, n = 0; clrscr();
printf (" Array Elements before sorting: "); for (i=0; i<5; i++)
printf ("%d ", x[i]);

selectionSort(n); /* call selection sort */
printf ("\n Array Elements after sorting: ");
for (i=0; i<5; i++)
printf ("%d ", x[i]);
}
selectionSort( int n)
{
int k, p, temp, min;
if (n== 4)
return (-1);
min = x[n];
p = n;
for (k = n+1; k<5; k++)
{
if (x[k] <min)
{
min = x[k];
p = k;
}
}
temp = x[n]; /* interchange x[n] and x[p] */ x[n] =
x[p];
x[p] = temp;
n++ ;
selectionSort(n);
}

QUICK SORT
The quick sort was invented by Prof. C. A. R. Hoare in the early 1960s. It was one of
the first most efficient sorting algorithms. It is an example of a class of algorithms that
work by divide and conquer technique.
The quick sort algorithm partitions the original array by rearranging it into two groups.
The first group contains those elements less than some arbitrary chosen value taken
from the set, and the second group contains those elements greater than or equal to
the chosen value. The chosen value is known as the pivot element. Once the array has
been rearranged in this way with respect to the pivot, the same partitioning procedure
is recursively applied to each of the two subsets. When all the subsets have been
partitioned and rearranged, the original array is sorted.
The function partition() makes use of two pointers up and down which are moved
toward each other in the following fashion:
1. Repeatedly increase the pointer up until a[up] >= pivot.

2. Repeatedly decrease the pointer down until a[down] <= pivot.
3. If down > up, interchange a[down] with a[up]
4. Repeat the steps 1, 2 and 3 till the up pointer crosses the down pointer. If
up pointer crosses down pointer, the position for pivot is found and place
pivot element in down pointer position.
The program uses a recursive function quicksort(). The algorithm of quick sort function
sorts all elements in an array a between positions low and high.
1. It terminates when the condition low >= high is satisfied. This condition will
be satisfied only when the array is completely sorted.
2. Here we choose the first element as the pivot. So, pivot = x[low]. Now it
calls the partition function to find the proper position j of the element x[low]
i.e. pivot. Then we will have two sub-arrays x[low], x[low+1], . . . . . . x[j-1]
and x[j+1], x[j+2], . . . x[high].
3. It calls itself recursively to sort the left sub-array x[low], x[low+1], . . . . . . .

x[j-1] between positions low and j-1 (where j is returned by the partition
function).
4. It calls itself recursively to sort the right sub-array x[j+1], x[j+2], . . x[high]
between positions j+1 and high.
The time complexity of quick sort algorithm is of O(n log n).

Algorithm
Sorts the elements a[p], . . . . . ,a[q] which reside in the global array a[n] into
ascending order. The a[n + 1] is considered to be defined and must be greater than all
elements in a[n]; a[n + 1] = +
quicksort (p, q)
{
if ( p < q ) then
{
call j = PARTITION(a, p, q+1); // j is the position of the partitioning element
call quicksort(p, j 1);
call quicksort(j + 1 , q);
}
}
partition(a, m, p)
{
v = a[m]; up = m; down = p; // a[m] is the partition element
do
{
repeat
up = up + 1;
until (a[up] > v);
repeat
down = down 1;
until (a[down] < v);
if (up < down) then call interchange(a, up, down);
} while (up > down);
a[m] = a[down];
a[down] = v;
return (down);
}
interchange(a, up, down)

{
p = a[up];
a[up] = a[down];
a[down] = p;
}
Example:
Select first element as the pivot element. Move up pointer from left to right in search
of an element larger than pivot. Move the down pointer from right to left in search of
an element smaller than pivot. If such elements are found, the elements are swapped.
This process continues till the up pointer crosses the down pointer. If up pointer
crosses down pointer, the position for pivot is found and interchange pivot and
element at down position.

Let us consider the following example with 13 elements to analyze quick sort:
1 2 3 4 5 6 7 8 9 10 11 12 13 Remarks
38 08 16 06 79 57 24 56 02 58 04 70 45
swap up &
pivot up down
down
pivot 04 79
swap up &
pivot up down
down
pivot 02 57
swap pivot
pivot down up
& down
(24 08 16 06 04 02) 38 (56 57 58 79 70 45)
swap pivot
pivot down up
& down
(02 08 16 06 04) 24
pivot, swap pivot
up
down & down
02 (08 16 06 04)
swap up &
pivot up down
down
pivot 04 16
pivot down Up
swap pivot
(06 04) 08 (16)
& down
pivot down up
swap pivot
(04) 06
& down
04
pivot,
down,
up
16
pivot,
down,
up
(02 04 06 08 16 24) 38

(56 57 58 79 70 45)
pivot up down swap up &

down
pivot 45 57
swap pivot
pivot down up
& down
(45) 56 (58 79 70 57)
45
pivot, swap pivot
down, & down
up
(58 79 57) swap up &
70
pivot up down down
57 79
down up
(57) 58 (70 79) swap pivot
& down
57
pivot,
down,
up
(70 79)
pivot, up swap pivot
down & down
70
79
pivot,
down,
up
(45 56 57 58 70 79)
02 04 06 08 16 24 38 45 56 57 58 70 79
Recursive program for Quick Sort
# include<stdio.h>
# include<conio.h>
void quicksort(int, int);

int partition(int, int); void
interchange(int, int); int
array[25];
int main()
{
int num, i = 0;
clrscr();
printf( "Enter the number of elements: " );
scanf( "%d", &num);
printf( "Enter the elements: " );
for(i=0; i < num; i++)
scanf( "%d", &array[i] );
quicksort(0, num -1);
printf( "\nThe elements after sorting are: " );

for(i=0; i < num; i++) printf("%d ", array[i]);
return 0;
}
void quicksort(int low, int high)

{
int pivotpos; if( low < high )
{
pivotpos = partition(low, high + 1); quicksort(low, pivotpos - 1);
quicksort(pivotpos + 1, high);
}
}
int partition(int low, int high)

{
int pivot = array[low];
int up = low, down = high;
do
{
do
up = up + 1; while(array[up] < pivot );
do
down = down - 1; while(array[down] > pivot);
if(up < down) interchange(up, down);
} while(up < down); array[low] = array[down]; array[down] =

pivot; return down;
}
void interchange(int i, int j)

{
int temp;
temp = array[i]; array[i] = array[j]; array[j] = temp;
}
MERGE SORT
Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides input array in two
halves, calls itself for the two halves and then merges the two sorted halves. The merge()
function is used for merging two halves. The merge(arr, l, m, r) is key process that
assumes that arr[l..m] and arr[m+1..r] are sorted and merges the two sorted sub-arrays
into one.

MergeSort(arr[], l, r)
If r > l
1. Find the middle point to divide the array into two halves:
middle m = (l+r)/2
2. Call mergeSort for first half:
Call mergeSort(arr, l, m)
3. Call mergeSort for second half:
Call mergeSort(arr, m+1, r)
4. Merge the two halves sorted in step 2 and 3:
Call merge(arr, l, m, r)
The following diagram shows the complete merge sort process for an example array {38,
27, 43, 3, 9, 82, 10}. If we take a closer look at the diagram, we can see that the array is
recursively divided in two halves till the size becomes 1. Once the size becomes 1, the
merge processes comes into action and starts merging arrays back till the complete array is
merged.

C program for Merge Sort
#include<stdlib.h>
#include<stdio.h>
// Merges two subarrays of arr[].

// First subarray is arr[l..m]
// Second subarray is arr[m+1..r]
void merge(int arr[], int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
/* create temp arrays */

int L[n1], R[n2];
/* Copy data to temp arrays L[] and R[] */

for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1+ j];
/* Merge the temp arrays back into arr[l..r]*/

i = 0; // Initial index of first subarray
j = 0; // Initial index of second subarray
k = l; // Initial index of merged subarray
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
/* Copy the remaining elements of L[], if there are any */

while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
/* Copy the remaining elements of R[], if there are any */

while (j < n2)

{
arr[k] = R[j];
j++;
k++;
}
}
/* l is for left index and r is right index of the

sub-array of arr to be sorted */
void mergeSort(int arr[], int l, int r)
{
if (l < r)
{
// Same as (l+r)/2, but avoids overflow for
// large l and h
int m = l+(r-l)/2;
// Sort first and second halves

mergeSort(arr, l, m);
mergeSort(arr, m+1, r);
merge(arr, l, m, r);
}
}
/* UTILITY FUNCTIONS */
/* Function to print an array */
void printArray(int A[], int size)
{
int i;
for (i=0; i < size; i++)
printf("%d ", A[i]);
printf("\n");
}
/* Driver program to test above functions */

int main()
{
int arr[] = {12, 11, 13, 5, 6, 7};
int arr_size = sizeof(arr)/sizeof(arr[0]);
printf("Given array is \n");

printArray(arr, arr_size);
mergeSort(arr, 0, arr_size - 1);
printf("\nSorted array is \n");

printArray(arr, arr_size);
return 0;
}

Output:
Given array is
12 11 13 5 6 7
Sorted array is
5 6 7 11 12 13
INSERTION SORT
Insertion sort algorithm arranges a list of elements in a particular

order. In insertion sort algorithm, every iteration moves an element
from unsorted portion to sorted portion until all the elements are
sorted in the list.

Insertion Sort program in C
#include<stdio.h>
#include<conio.h>
void main(){
int size, i, j, temp, list[100];
printf("Enter the size of the list: ");

scanf("%d", &size);
printf("Enter %d integer values: ", size);

for (i = 0; i < size; i++)
scanf("%d", &list[i]);
//Insertion sort logic

for (i = 1; i < size; i++) {
temp = list[i];
j = i - 1;
while ((temp < list[j]) && (j >= 0)) {
list[j + 1] = list[j];
j = j - 1;
}
list[j + 1] = temp;
}
printf("List after Sorting is: ");

for (i = 0; i < size; i++)
printf(" %d", list[i]);
getch();
}

Searching and Sorting 2

Uploaded by

Copyright:

Available Formats

Searching and Sorting 2

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Searching and Sorting 2

Uploaded by

Copyright:

Available Formats

Searching and Sorting

1. Linear or sequential search

Sorting allows an efficient arrangement of elements within a given data structure. It is

There are two types of sorting techniques:

Suppose there are n elements organized sequentially on a List. The number of

The time complexity of linear search is O(n).

Dept. of C.S.E, K.S.R.M.C.E Page 1

Let us illustrate linear search on the following 9 elements:

Searching different elements is as follows:

3. Searching for x = 42Search un-successful, data not found.

Dept. of C.S.E, K.S.R.M.C.E Page 2

A Recursive program for linear search:

void linear_search(int a[], int data, int position, int n)

Dept. of C.S.E, K.S.R.M.C.E Page 3

Let array a[n] of elements in increasing order, n 0, determine whether x is present,

Dept. of C.S.E, K.S.R.M.C.E Page 4

Let us illustrate binary search on the following 12 elements:

If we are searching for x = 4: (This needs 3 comparisons)

If we are searching for x = 7: (This needs 4 comparisons)

If we are searching for x = 8: (This needs 2 comparisons)

If we are searching for x = 9: (This needs 3 comparisons)

If we are searching for x = 16: (This needs 4 comparisons)

If we are searching for x = 20: (This needs 1 comparison)

If we are searching for x = 24: (This needs 3 comparisons)

If we are searching for x = 38: (This needs 4 comparisons)

If we are searching for x = 39: (This needs 2 comparisons)

If we are searching for x = 45: (This needs 4 comparisons)

Dept. of C.S.E, K.S.R.M.C.E Page 5

If we are searching for x = 77: (This needs 4 comparisons)

The number of comparisons necessary by search element:

Let us illustrate binary search on the following 9 elements:

The number of comparisons required for searching different elements is as follows:

1. If we are searching for x = 101: (Number of comparisons = 4)

2. Searching for x = 82: (Number of comparisons = 3)

3. Searching for x = 42: (Number of comparisons = 4)

Dept. of C.S.E, K.S.R.M.C.E Page 6

No element requires more than 4 comparisons to be found. Summing the comparisons

A non-recursive program for binary search:

Dept. of C.S.E, K.S.R.M.C.E Page 7

A recursive program for binary search:

void bin_search(int a[], int data, int low, int high)

bin_search(a, data, mid+1, high);

Dept. of C.S.E, K.S.R.M.C.E Page 8

Consider the array x[n] which is stored in memory as shown below:

X[0] X[1] X[2] X[3] X[4] X[5]

Pass 1: (first element is compared with all other elements).

X[0] X[1] X[2] X[3] X[4] X[5] Remarks

Pass 2: (second element is compared).

X[0] X[1] X[2] X[3] X[4] Remarks

The second biggest number 55 is moved now to X[4].

Dept. of C.S.E, K.S.R.M.C.E Page 9

X[0] X[1] X[2] X[3] Remarks

Pass 4: (fourth element is compared).

X[0] X[1] X[2] Remarks

Pass 5: (fifth element is compared).

For an array of size n, we required (n-1) passes.

Program for Bubble Sort

Dept. of C.S.E, K.S.R.M.C.E Page 10

Dept. of C.S.E, K.S.R.M.C.E Page 11