Scala练习-冒泡排序

  def sort(unSort: Array[Int]): Array[Int] = {

    val size = unSort.size
    for (i <- 0 until size - 1) {
      for (j <- 0 until size - 1 - i) {
        if (unSort(j) > unSort(j + 1)) {
          val temp = unSort(j)
          unSort(j) = unSort(j + 1)
          unSort(j + 1) = temp
        }
      }
    }
    unSort
  }