void bubbleSort (int arr[], int Left, int Right){
for (int j = 0; j < Right; j++){
for (int i = j; i < Right;i++){
int r = Right - i, l = r - 1;
if(arr[l]>arr[r]){
swap(arr[l],arr[r]);
}
}
}
}
地理信息系统1之冒泡排序(Bubble sort)
最新推荐文章于 2024-06-18 18:40:57 发布