Hide text Hide pseudo-code | |

Use radix exchange sort to sort the table below. The parameters are on top of the call stack, denote the bit to sort on and the boundaries of the currently active area. The parameters of the initial radix_exchange_sort function call have been placed in the stack as a starting point. Some additional problems. | |

radix_exchange_sort( array :Array, bit :integer, left :integer, right :integer ) split = partition(array, bit, left, right) if (bit > 0) if range is greater than 1 radix_exchange_sort(array, bit-1, left, split-1) if range is greater than 1 radix_exchange_sort(array, bit-1, split, right) end if return from function |