Write a MIPS assembly language for sorting an array of integers using non-recurs

Question

Write a MIPS assembly language for sorting an array of integers using non-recursive
bottom-up merge sort algorithm. Your program should print the processed array after
each step of the merge sort.

Bottom-up merge sort is a non-recursive variant of the merge sort, in which the array is sorted by a sequence of passes. During each pass, the array is divided into blocks of size m. (Initially, m1). Every two adjacent blocks are merged (as in normal merge sort), and the next pass is made with a twice larger value ofm. Here is the pseudo code for bottom-up merge sort: Input: array a[l indexed from 0 to n-1. while m

Explanation / Answer

Please find the code below with detailed inline comments.

CODE

====================

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---