|
|
本帖最后由 SKIDROW 于 2013-4-16 14:50 编辑
Help 发表于 2013-4-16 14:18 
代码呢 - void QuickSort(int s[], int Low, int High)
- {
- int i,j,x;
- if(Low >= High)
- return;
- i = Low;
- j = High;
- x = s[i];
- while(i != j)
- {
- while(s[j] > x && i < j)
- j = j - 1;
- if(i < j)
- {
- s[i] = s[j];
- i = i + 1;
- }
- while(s[i] < x && i <j)
- i = i + 1;
- if(i < j)
- {
- s[j] = s[i];
- j = j - 1;
- }
- }
- s[i] = x;
- QuickSort(s,Low,i - 1);
- QuickSort(s,j + 1,High);
- }
复制代码 给你快速排序的吧,参数是数组、起始下标、结束下标,自己改成Shell的吧。 |
|