冒泡排序,选择排序,快速排序三种排序方式

(1)冒泡排序

for (i = 0; i < arr.length - 1; i++) {
    
    
  for (j = 0; j < arr.length - i - 1; j++) {
    
    
    if (arr[j] > arr[j + 1]) {
    
    
      var tmp = arr[j];
      arr[j] = arr[j + 1];
      arr[j + 1] = tmp;
    }
  }
}

(2)选择排序

for (i = 0; i < arr.length - 1; i++) {
    
    
  for (j = i + 1; j < arr.length; j++) {
    
    
    if (arr[i] < arr[j]) {
    
    
      var tmp = arr[i];
      arr[i] = arr[j];
      arr[j] = tmp;
    }
  }
}

(3)快速排序

for (i = 0; i < arr.length - 1; i++) {
    
    
  for (j = i + 1; j < arr.length; j++) {
    
    
    if (arr[i] < arr[j]) {
    
    
      var tmp = arr[i];
      arr[i] = arr[j];
      arr[j] = tmp;
    }
  }

猜你喜欢

转载自blog.csdn.net/qq_45785424/article/details/108065367