update sort readme
This commit is contained in:
+2
-1
@@ -94,6 +94,7 @@
|
||||
1. 挖坑排序,2头向中间扫描,先从后向前找,再从前向后找。
|
||||
2. 单向扫描
|
||||
|
||||
```
|
||||
void quicksort(int *a, int left, int right){
|
||||
if (left<right)//加上这个,不然有死循环,造成堆栈溢出,这也是递归结束条件
|
||||
{
|
||||
@@ -130,7 +131,7 @@
|
||||
return i;
|
||||
}
|
||||
|
||||
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user