flutter - 冒泡排序

sort函数排序

List<int> geeksforgeeks = [13, 2, -11, 142, -389, 32, 3032, 0];

// Sorting List
geeksforgeeks.sort();

// Printing Sorted List
print(geeksforgeeks);

//[-389, -11, 0, 2, 13, 32, 142, 3032]

冒泡排序

  var list=[12,34,33,45243,345,656,676,324,345,23,45,56,67,909];

  for (var i = 0; i < list.length-1; i++) {
    
    
    for (var j = 0; j < list.length-1-i; j++) {
    
    
      if(list[j]>list[j+1]){
    
    
        int temp=list[j];
        list[j]=list[j+1];
        list[j+1]=temp;
      }
    }
  }
  print(list);
//[12, 23, 33, 34, 45, 56, 67, 324, 345, 345, 656, 676, 909, 45243]

猜你喜欢

转载自blog.csdn.net/python4_1/article/details/121992684
今日推荐