fanbird2008的专栏

void insert_sort(vector &v) {     for(int i = 1; i         int p = i - 1, t = v[i];         while(p >= 0 && t             v[p + 1] = v[p];             p--;         }         v[p + 1] = t;

void select_sort(vector &v) {     for(int i = 0; i         int t = i;         for(int j = i + 1; j             if(v[j]         }         if(t != i) {             int tt = v[i];

void merge(vector &v, int left, int mid, int right) {     int i = 0, tt[right - left + 1];     int nl = left, nm = mid + 1;     if(left >= right) return;     while(nl         if(v[nl]

void bubble_sort(vector &v) {     for(int i = 0; i         for(int j = 1; j             if(v[j - 1]             int t = v[j -1];             v[j - 1] = v[j];             v[j] = t;         }

int partition(vector<int> &v, int left, int right) { int pivot = v[left]; while(left < right){ while(left < right && v[right] > pivot) right--; ...

void count_sort(vector &v, vector&res) {     int t = 0;     vector r, c;     r.assign(4096, 0);     for(int i = 0; i     c = r;     res = r;     for(int i = 0; i         r[v[i]]++;

int get0to9(int n, int d) {     while(n != 0 && d > 0) {         n /= 10; d--;     }     return n % 10; } void count_sort0to9(vector &v, int index) {     int count[10];     vector b = v;