-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
40 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,37 @@ | ||
| # [Flutter的冒泡排序和快速排序](https://github.com/platojobs/SFLOG/issues/338) | ||
|
|
||
| ```dart | ||
| // 冒泡排序 in Flutter | ||
| List<int> bubbleSort(List<int> arr) { | ||
| int n = arr.length; | ||
| for (int i = 0; i < n - 1; i++) { | ||
| for (int j = 0; j < n - i - 1; j++) { | ||
| if (arr[j] > arr[j + 1]) { | ||
| int temp = arr[j]; | ||
| arr[j] = arr[j + 1]; | ||
| arr[j + 1] = temp; | ||
| } | ||
| } | ||
| } | ||
| return arr; | ||
| } | ||
| // 快速排序 in Flutter | ||
| List<int> quickSort(List<int> arr) { | ||
| if (arr.length <= 1) return arr; | ||
| int pivot = arr[arr.length ~/ 2]; | ||
| List<int> left = []; | ||
| List<int> right = []; | ||
| for (int i = 0; i < arr.length; i++) { | ||
| if (arr[i] < pivot) { | ||
| left.add(arr[i]); | ||
| } else if (arr[i] > pivot) { | ||
| right.add(arr[i]); | ||
| } | ||
| } | ||
| return [...quickSort(left), pivot, ...quickSort(right)]; | ||
| } | ||
| ``` |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters