#include using namespace std; const int range=5; //list-s are starting index of arrays which are created by "deviding" bigger //array on two equal halfs if rang e of array is even // if range of array is odd number, then then range of left "child" array is // is for one greater then range of the right "child" array void Merge(int Temp[], int Element[], const int list1, const int size1, const int list2, const int size2) { int i = list1, j = list2, k = list1; while(i < list1 + size1 && j < list2 + size2) { if (Temp[i] < Temp[j]) Element[k++] = Temp[i++]; else Element[k++] = Temp[j++]; } while (i < list1 + size1) Element[k++] = Temp[i++]; while (j < list2 + size2) Element[k++] = Temp[j++]; for (k = list1; k < list1 + size1 + size2; k++) Temp[k] = Element[k]; } void MergeSort(int Temp[], int Element[], const int list1, const int size) { int list2, size1, size2; if (size > 1) { list2 = list1 + size / 2; size1 = list2 - list1; size2 = size - size1; MergeSort(Temp, Element, list1, size1); MergeSort(Temp, Element, list2, size2); Merge(Temp, Element, list1, size1, list2, size2); } } int main() { int arr[range]={84,22,90,78,16}; int ele[range]; MergeSort(arr, ele, 0, 5); for(int i=0;i

mergeSort