Question

I need help of how to include the merge sort code into this counter code found below:

#include<iostream>
using namespace std;
int bubble_counter=0,selection_counter=0; // variables global

void bubble_sort(int [], int);
void show_array(int [],int);
void selectionsort(int [], int );

int main()
{
int a[7]={4,1,7,2,9,0,3};
show_array(a,7);
//bubble_sort(a,7);
selectionsort(a,7);
show_array(a,7);
cout<<"Bubble counter = "<<bubble_counter<<endl;
cout<<"Selection Counter = "<<selection_counter<<endl;

return 0;
}
void show_array(int array[],int size)
{
for( int i=0 ; i<size; i++)
{
cout<<array[i]<< " ";
}
cout<<endl;
}
void bubble_sort( int array[], int size)
{
bool swap;
int temp;

do
{
swap =false;
for(int count=0; count< (size -1);count ++)
{ bubble_counter++;
if(array[count]>array[count +1])
{
temp =array[count];
array[count]=array[count +1];
array[count +1]= temp;
swap = true;
}
}
  
}while(swap);

}
void selectionsort(int array [], int size)
{
int startscan, minindex, minivalue;

for (startscan = 0; startscan < (size - 1); startscan++)
{
minindex = startscan;
minivalue = array[startscan];
for(int index = startscan + 1; index < size; index++)
{ selection_counter++;
if (array[index] <minivalue)
{
minivalue = array[index];
minindex = index;
}
}
array[minindex] = array[startscan];
array[startscan] = minivalue;
}
}

Answer 1

Updated C++ Program:

#include<iostream>
using namespace std;

int bubble_counter=0, selection_counter=0; // variables global

void bubble_sort(int [], int);
void show_array(int [],int);
void selectionsort(int [], int);

int mergeSort(int[], int, int);
int mergeArrays(int[], int, int, int);

int main()
{
int a[7]={4,1,7,2,9,0,3};
int mergeCounter=0;
show_array(a,7);
//bubble_sort(a,7);
//selectionsort(a,7);

mergeCounter = mergeSort(a, 0, 6); //Merge Sort

show_array(a,7);
cout<<"Bubble counter = "<<bubble_counter<<endl;
cout<<"Selection Counter = "<<selection_counter<<endl;
cout<<"Merge Sort Counter = "<<mergeCounter<<endl;
return 0;
}

void show_array(int array[],int size)
{
for( int i=0 ; i<size; i++)
{
cout<<array[i]<< " ";
}
cout<<endl;
}

void bubble_sort( int array[], int size)
{
bool swap;
int temp;

do
{
swap =false;
for(int count=0; count< (size -1);count ++)
{
bubble_counter++;
if(array[count]>array[count +1])
{
temp =array[count];
array[count]=array[count +1];
array[count +1]= temp;
swap = true;
}
}
}while(swap);
}

void selectionsort(int array [], int size)
{
int startscan, minindex, minivalue;

for(startscan = 0; startscan < (size - 1); startscan++)
{
minindex = startscan;
minivalue = array[startscan];
for(int index = startscan + 1; index < size; index++)
{
selection_counter++;
if (array[index] <minivalue)
{
minivalue = array[index];
minindex = index;
}
}
array[minindex] = array[startscan];
array[startscan] = minivalue;
}
}

//Merge Sort implementation
//Function that sorts the array
int mergeSort(int arr[], int low, int high)
{
int mid;
int merge_counter = 0;

//Loop till both boundaries meet
if(low < high)
{
//Calculating middle position of array
mid=(low+high)/2;

//Operating on left side of array
merge_counter = merge_counter + mergeSort(arr, low, mid);

//Operating on right side of array
merge_counter = merge_counter + mergeSort(arr, mid+1, high);

//Merging arrays
merge_counter = merge_counter + mergeArrays(arr, low, mid, high);
}
return merge_counter;
}

//Function that sorts two arrays into single array
int mergeArrays(int arr[],int low,int mid,int high)
{
int cmpCnt=0;
int i, j, k, temp[50];

//Initializing indexes
i = low;
k = low;

j = mid + 1;

//Loop till either of array reaches boundary
while (i <= mid && j <= high)
{
//Comparing elements
if (arr[i] < arr[j])
{
//Adding to array from left side
temp[k] = arr[i];

//Incrementing index
k++;
i++;
cmpCnt++;
}
else
{
//Adding to array from left side
temp[k] = arr[j];

//Incrementing index
k++;
j++;
cmpCnt++;
}
}

//Adding elements from left side array
while (i <= mid)
{
temp[k] = arr[i];
k++;
i++;
}

//Adding elements from right side array
while (j <= high)
{
temp[k] = arr[j];
k++;
j++;
}

//Copying values
for (i = low; i < k; i++)
{
arr[i] = temp[i];
}

return cmpCnt;
}
______________________________________________________________________________________________________

Sample Run: