Question

NAME: 1. Sppose you have an integer array A with N elements (A is global). Function select_sort () performs a select sort of A. Convert the following to a Pseudo-C with goto's. void select_sort (int N){ int i, j, min, max, tmp; for (i = 1; i <= N / 2; i++){ min = i; max = i; for (j = i + 1; j <= N - i; j++){ if (A[j] > A[max]){ max = j; continue; } if (A[j] < A[min]){ min = j; } } } tmp = A[i - 1]; A[i - 1] = A[min]; A[min] = tmp; tmp = A[N - i]; A[N - i] = A[max]; A[max] = tmp; } 2. Use a separate sheet of paper, and convert Pseudo-C into MIPS.

          NAME:
1. Sppose you have an integer array A with N elements (A is global). Function select_sort ()
performs a select sort of A. Convert the following to a Pseudo-C with goto's.
void select_sort (int N){
int i, j, min, max, tmp;
for (i = 1; i <= N / 2; i++){
min = i;
max = i;
for (j = i + 1; j <= N - i; j++){
if (A[j] > A[max]){
max = j;
continue;
}
if (A[j] < A[min]){
min = j;
}
}
}
tmp = A[i - 1];
A[i - 1] = A[min];
A[min] = tmp;
tmp = A[N - i];
A[N - i] = A[max];
A[max] = tmp;
}
2. Use a separate sheet of paper, and convert Pseudo-C into MIPS.

NAME:
1. Sppose you have an integer array A with N elements (A is global). Function selectsort ()
performs a select sort of A. Convert the following to a Pseudo-C with goto's.
void selectsort (int N)
int i, j, min, max, tmp;
for (i = 1; i <= N / 2; i++)
min = i;
max = i;
for (j = i + 1; j <= N - i; j++)
if (A[j] > A[max])
max = j;
continue;

if (A[j] < A[min])
min = j;

tmp = A[i - 1];
A[i - 1] = A[min];
A[min] = tmp;
tmp = A[N - i];
A[N - i] = A[max];
A[max] = tmp;

2. Use a separate sheet of paper, and convert Pseudo-C into MIPS.

Added by Lori J.

Question

Please give Ace some feedback