Merge Sort Implementation Without Recursion in C++

Question

Implement the merge_sort procedure without recursion, where the size of the vector is an arbitrary number.
Hint: Keep merging adjacent areas whose size is a power of 2, and pay special attention to the last area in the sequence.

Solution Preview

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

void iterative_merge_procedure(int n1,int n2,int n3)
{
int i,j,k; //temporary indexes
i=n1; j=n2; k=n1;
while (i<n2 && j<n3) {
if (v1[i]<=v1[j]) {v2[k]=v1[i]; i++;}
else {v2[k]=v1[j]; j++;}
k++;
}...

This is only a preview of the solution. Please use the purchase button to see the entire solution

$25.00 for this solution