I want some quick tweaks to this existing code. Just to make sure it looks and functions exactly as it is needed. THIS IS NOT A LONG FIX WHATSOEVER. This is about a hour and a half job at max. The...

I want some quick tweaks to this existing code. Just to make sure it looks and functions exactly as it is needed. THIS IS NOT A LONG FIX WHATSOEVER. This is about a hour and a half job at max. The fixes I want is everything mentioned below.

• Using
  
  
  


• In the radix sort function, you have to implement the base-10 version of radix-sort (Algorithm 2 in the
  LinearTimeSorting.pdf
  
  notes).
  
  
  
  
  • Count-sort on digits and radix-sort non-negative are already well-defined in the notes. The radix-sort method in the assignment is where you will implement Approach 1 or 2 (in theLinearTimeSorting.pdfnotes), and then call the radix-sort non-negative function.
    
    
  
  
  • If you have implemented base-n radix-sort (Algorithm 3) and got the correctness part working, that may be okay. But, you must check the TestTime part to make sure that runs properly and you do not run out of memory. In base-n version, the C[] array will be as large as the original array (or may be larger because of negative numbers), and that extra space may lead to an out of memory exception. So, probably better to change to base-10 version --- it should only need a few tweaks.