Given the list of integers 2,-10, 12, 25, -32, 22, 56, 5, you are required to find the element whose rank is 4. This is the element whose index is 4, when the list is sorted in increasing order and indexed from 1 to 8. You are not allowed to sort the entire list; instead, you must use the PARTITION procedure discussed in class for QuickSort to partition the above list, determine which list contains the element you are looking for and recursively continue with this abbreviated list. Make a table with two columns: the first column enumerates the list in which the element lies and the second column states its rank in this list. Thus the first (and trivial) row entry would have the above list in the first column and 4 in the second column.

Given the list of integers 2,-10, 12, 25, -32, 22, 56, 5, you are required to find the element whose rank is 4. This is the element whose index is 4, when the list is sorted in increasing order and indexed from 1 to 8. You are not allowed to sort the entire list; instead, you must use the PARTITION procedure discussed in class for QuickSort to partition the above list, determine which list contains the element you are looking for and recursively continue with this abbreviated list. Make a table with two columns: the first column enumerates the list in which the element lies and the second column states its rank in this list. Thus the first (and trivial) row entry would have the above list in the first column and 4 in the second column.