#include using namespace std; /* The main idea for this non recursion algoritm split it for two parts. 1. Sort blocks in array size of two elements, without using merge. 2. Step by step move in array from lower(2) to hier (depends on array size) block size and merg pair of blocks(leftSize and rightSize). At the end of array increase block size by 2 and start from arr[0] */ void arrPrint(int *arr,int arrSize) { //cout<=block[k+leftSize]) {bufBlock[j+k]=block[k+leftSize]; k++;} else {bufBlock[j+k]=block[j]; j++;} else //if left or right block over, input the last one if(j==leftSize){ bufBlock[j+k]=block[k+leftSize]; k++;} else {bufBlock[j+k]=block[j]; j++;} } else//if function have only one left, unsorted block it use bubble sort inside block. really low possible sittuation. { for(int i=0;iblock[j+1]) { int tmp=block[j]; block[j]=block[j+1]; block[j+1]=tmp; } } return; } //end while for(int i=0;i>arrSize; if(arrSize<4)arrSize=4; int* arr=new int[arrSize]; //Generate random array cout<<"Random array ="; for(int i=0;iarr[i+1]){ int tmp; tmp=arr[i+1]; arr[i+1]=arr[i]; arr[i]=tmp; } } cout<<"Sorted in pairs ="; arrPrint(arr,arrSize); //Now we have simply sorted pair array. then merge blocks consistently in do while loop. int start=0,leftSize=2,rightSize=2,blockSize=2,cicleCounter=0,jj=0; do { cicleCounter++; //cout<<"CC="<=arrSize)break; else //reset varaibles for next loop if(start==arrSize)//if all elements on this blocksize-array over, increase block size {start=0; blockSize*=2; leftSize=blockSize; rightSize=blockSize; } //if number of elements in last pair of blocks in array lower than two block size, set left,right block size manually. if(arrSize-start blockSize){ leftSize=blockSize; rightSize=arrSize-start-blockSize; } if(arrSize-start < blockSize){ leftSize=arrSize-start; rightSize=0; } if(arrSize-start == blockSize){ leftSize=blockSize; rightSize=0; } /* cout<<"LeftSize= "<

Merge sort(non recursion)