A Sorting Problem
Description
It's MZW!It's the man who is crazy about optimization in basic operations!
MZW is so crazy about sorting algorithms with linear-time-complexty that he has made another problem about them.
It's an interactive problem -- again.
I'll give you an array, and you should turn it into a non-descending sequence.
You should design a function like the one below:
void Sort(unsigned short *a,int n);Turn a[0,n) into a non-descending sequence.