@@ -8,17 +8,6 @@ void quickSort(List<int> data) {
88 _internalQuickSort (data, lower, partitionIndex - 1 );
99 _internalQuickSort (data, partitionIndex + 1 , upper);
1010 }
11- return null ;
12- }
13-
14- void _swap (List <int > data, int first, int second) {
15- var value1 = data[first];
16- var value2 = data[second];
17- var temp = value1;
18- value1 = value2;
19- value2 = temp;
20- data[first] = value1;
21- data[second] = value2;
2211}
2312
2413int _partition (List <int > data, int lower, int upper) {
@@ -28,11 +17,11 @@ int _partition(List<int> data, int lower, int upper) {
2817 for (var j = lower; j < upper; j++ ) {
2918 if (data[j] <= pivot) {
3019 i++ ;
31- _swap (data, i, j);
20+ _swap (i, j, data );
3221 }
3322 }
3423
35- _swap (data, i + 1 , upper);
24+ _swap (i + 1 , upper, data );
3625 return (i + 1 );
3726}
3827
@@ -47,3 +36,13 @@ void _internalQuickSort(List<int> data, int lower, int upper) {
4736 _internalQuickSort (data, partitionIndex + 1 , upper);
4837 }
4938}
39+
40+ void _swap (int first, int second, List <int > data) {
41+ var value1 = data[first];
42+ var value2 = data[second];
43+ final temp = value1;
44+ value1 = value2;
45+ value2 = temp;
46+ data[first] = value1;
47+ data[second] = value2;
48+ }
0 commit comments