Practical No.

: 5
Write a program to do a bubble sort on an array.
PSEUDO CODE:
SUBROUTINE mergeSort(array)
If len(array) > 1 Then
# This is the point where the array is divided into two subarrays
halfArray = len(array) / 2

FirstHalf = array[:halfArray]
# The first half of the data set

SecondHalf = array[halfArray:]
# The second half of the data set

# Sort the two halves

mergeSort(FirstHalf)
mergeSort(SecondHalf)

k=0

# Begin swapping values

While i < len(FirstHalf) and j < len(SecondHalf)
If FirstHalf[i] < SecondHalf[j] Then
array[k] = FirstHalf[i]
i += 1
Else
array[k] = SecondHalf[j]
j += 1
k += 1
EndIf
EndWhile
EndIf

outputList(array)
ENDSUBROUTINE

SUBROUTINE outputList()
FOR i in len(array)
OUTPUT array[i]
ENDFOR
ENDSUBROUTINE

array = [6, 5, 12, 10, 9, 1]

mergeSort(array)
CODE:
#include<iostream.h>
#include<conio.h>
#define MAX 100
void merge(int arr[MAX], int p, int q, int r)
{
int n1 = q - p + 1;
int n2 = r - q;

int L[MAX], M[MAX];

for (int i = 0; i < n1; i++)

L[i] = arr[p + i];
for (int j = 0; j < n2; j++)
M[j] = arr[q + 1 + j];

int k;
i = 0;
j = 0;
k = p;
while (i < n1 && j < n2)
{
if (L[i] <= M[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = M[j];
j++;
}
k++;
}
while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}

while (j < n2)

{
arr[k] = M[j];
j++;
k++;
}
}

void mergeSort(int arr[MAX], int l, int r)

{
if (l < r)
 {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}

void printArray(int arr[MAX], int size)

{
for (int i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}
void main()
{
clrscr();
int arr[MAX];
int size;
cout<<"\n\n\tName : Kshitij Goyal";
cout<<"\n\tEnrollment No. : A023116120009."<<endl;

cout<<"\n\n\tPlease enter the size of array:";

cin>>size;
cout<<"\tPlease enter the elements of the array:\n\n\t";
for(int i=0;i<size;i++)
{
cin>>arr[i];
}
mergeSort(arr, 0, size - 1);
cout << "\n\n\tSorted array: \n\t";
printArray(arr, size);
getch();
}
OUTPUT:

COMPLEXITY: O(n*log n)