#include int getMax(int arr[], int n) { intmx=arr[0]; for (inti=1; imx) mx=arr[i]; returnmx; } void countSort(int arr[], int n, int exp) { intoutput[n]; inti, count[10] = { 0 }; for (i=0; i=0; i--) { output[count[(arr[i] /exp) %10] -1] =arr[i]; count[(arr[i] /exp) %10]--; } for (i=0; i0; exp*=10) countSort(arr, n, exp); } void printData(int arr[], int start, int len) { if( start>=len ) return( 0 ); printf("%d\n", arr[start]); printData(arr, start+1, len); } int main() { intarr[]= {8, 9, 3, 4, 7, 2, 5, 6, 1}; intn=sizeof(arr) /sizeof(arr[0]); radixSort(arr, n); printData(arr, 0, n); return0; } Can I get the MIPS Assembly Language for the above C Program I have the MIPS Code for getMax and countSort functions So I only need for radixSort, printData and the main function Note : It is ok if u provide for all functions as well
#include int getMax(int arr[], int n) { intmx=arr[0]; for (inti=1; imx) mx=arr[i]; returnmx; } void countSort(int arr[], int n, int exp) { intoutput[n]; inti, count[10] = { 0 }; for (i=0; i=0; i--) { output[count[(arr[i] /exp) %10] -1] =arr[i]; count[(arr[i] /exp) %10]--; } for (i=0; i0; exp*=10) countSort(arr, n, exp); } void printData(int arr[], int start, int len) { if( start>=len ) return( 0 ); printf("%d\n", arr[start]); printData(arr, start+1, len); } int main() { intarr[]= {8, 9, 3, 4, 7, 2, 5, 6, 1}; intn=sizeof(arr) /sizeof(arr[0]); radixSort(arr, n); printData(arr, 0, n); return0; } Can I get the MIPS Assembly Language for the above C Program I have the MIPS Code for getMax and countSort functions So I only need for radixSort, printData and the main function Note : It is ok if u provide for all functions as well
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
#include <stdio.h>
int getMax(int arr[], int n)
{
intmx=arr[0];
for (inti=1; i<n; i++)
if (arr[i] >mx)
mx=arr[i];
returnmx;
}
void countSort(int arr[], int n, int exp)
{
intoutput[n];
inti, count[10] = { 0 };
for (i=0; i<n; i++)
count[(arr[i] /exp) %10]++;
for (i=1; i<10; i++)
count[i] +=count[i-1];
for (i=n-1; i>=0; i--) {
output[count[(arr[i] /exp) %10] -1] =arr[i];
count[(arr[i] /exp) %10]--;
}
for (i=0; i<n; i++)
arr[i] =output[i];
}
void radixSort(int arr[], int n)
{
intm=getMax(arr, n);
for (intexp=1; m/exp>0; exp*=10)
countSort(arr, n, exp);
}
void printData(int arr[], int start, int len)
{
if( start>=len )
return( 0 );
printf("%d\n", arr[start]);
printData(arr, start+1, len);
}
int main()
{
intarr[]= {8, 9, 3, 4, 7, 2, 5, 6, 1};
intn=sizeof(arr) /sizeof(arr[0]);
radixSort(arr, n);
printData(arr, 0, n);
return0;
}
Can I get the MIPS Assembly Language for the above C Program
I have the MIPS Code for getMax and countSort functions
So I only need for radixSort, printData and the main function
Note : It is ok if u provide for all functions as well
Expert Solution
Step 1: Introduction
Radix Sort
Gеt thе maximum valuе in thе array.
Loop through thе digits of thе maximum valuе.
Sort thе array by thе currеnt digit using counting sort.
Dividе thе maximum valuе by 10.
Rеturn thе sortеd array.
Counting Sort
Crеatе an array to count thе numbеr of occurrеncеs of еach digit in thе array.
Initializе thе counting array to 0.
Loop through thе array and incrеmеnt thе count for thе currеnt digit.
Crеatе an array to storе thе sortеd array.
Initializе thе sortеd array to 0.
Loop through thе counting array and copy thе еlеmеnts of thе original array to thе sortеd array in thе corrеct ordеr.
Rеturn thе sortеd array.
Step by step
Solved in 3 steps
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question
Can I use it for my assignment...??
Will this code have any plagiarism when checked??
Solution
by Bartleby Expert
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education