Ouput
, Code: just copy and paste into your IDE
#include <iostream>
#include <vector>
#include <ctime>
#include <cmath>
using namespace std;
//Function for Bubble sorting algorithm
void bubbleSort(vector <int>& arr , int size){
bool swapped;
for(int i = 0; i < size -1; i++){
swapped = false;
for(int j = 0;j < size - i -1; j++){
if(arr [j] > arr[j+1]){
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
swapped = true;
}
}
if(!swapped){
break;
}
}
}
void printVector(const vector <int>&arr , int size){
for(int i = 0; i < size; i++){
cout<<arr[i];
if(i < size - 1){
cout<<" ,";
}
}
cout<<endl;
}
//Function for Merge sorting algorithm
void merge(vector <int> &mergeArr , int low, int mid, int high){
int m1 = mid - low +1;
int m2 = high - mid;
vector<int> L(m1) , H(m2);
for(int i = 0 ; i < m1; ++i){
L[i] = mergeArr[low+i];
}
for(int j = 0; j < m2 ; ++j){
H[j] = mergeArr[mid+1+j];
}
int i = 0;
int j = 0;
int k = low;
while(i < m1 && j < m2){
if(L[i] <= H[j]){
mergeArr[k] = L[i];
++i;
}
else{
mergeArr[k] = H[j];
++j;
}
++k;
}