- BubbleSort(R, n)
- {
- int i, j;
- int tmp;
- int exchange;
- for(i = 0; i < n-1; i++)
- {
- exchange = 0;
- for(j = n-1; j > i; j--)
- {
- if(R[j] < R[j-1])
- {
- tmp = R[j];
- R[j] = R[j-1];
- R[j-1] = tmp;
- exchange = 1;
- }
- }
- if(exchange == 0)
- return 0;
- }
- }
- QuickSort(R, s, t)
- {
- int i,j;
- int tmp;
- i = s;
- j = t;
- if(s < t)
- {
- tmp = R[i];
- while(i != j)
- {
- while(i < j && R[j] > tmp)
- j--;
- R[i] = R[j];
- while(i < j && R[i] < tmp)
- i++;
- R[j] = R[i];
- }
- R[i] = tmp;
- QuickSort(R, s, i-1);
- QuickSort(R, i +1, t);
- }
- }