2. Suppose you have an integer array A with N elements (A is global). The array...

 

Transcribed Image Text:

2. Suppose you have an integer array A with N elements (A is global). The array A is sorted in ascending order. Function bin_searchO performs a binary search of A for a key and returns the index of the key (or -1 if not found). The following C code implements a non- recursive algorithm by continuously subdividing a range in halves. Convert the following to a Pseudo-C with goto's. In extra sheet of paper, convert Pseudo-C into MIPS. int bin_search(int N){ int found = 0; int min=0; int max-N-1; int index=-1; while (!found){ if (min > max) break; else { index floor((min+max)/2); = if (key=A(index)) found = 1; else if (key 2. Suppose you have an integer array A with N elements (A is global). The array A is sorted in ascending order. Function bin_searchO performs a binary search of A for a key and returns the index of the key (or -1 if not found). The following C code implements a non- recursive algorithm by continuously subdividing a range in halves. Convert the following to a Pseudo-C with goto's. In extra sheet of paper, convert Pseudo-C into MIPS. int bin_search(int N){ int found = 0; int min=0; int max-N-1; int index=-1; while (!found){ if (min > max) break; else { index floor((min+max)/2); = if (key=A(index)) found = 1; else if (key