scala实现各种排序算法

1、冒泡排序

object BubblingSort {
  /**
    * 比较相邻元素的大小，对于每次循环，按排序的规则把最值移向数组的一端，同时循环次数依次减少
    * @param args
    */
  def main(args: Array[String]): Unit = {
//    val testData = new ArrayBuffer[Int]
//    testData += 10;testData += 101;testData += 75;testData += 3;testData += 9;testData += 12;testData += 77;testData += 86;testData += 99;testData += 25
    val testData = ArrayBuffer(10, 101, 75, 3, 9, 12, 77, 86, 99, 25)
    println("testData = "+testData)
    val bubblingSortData=bubblingSort(testData)
    println("bubblingSortData = "+bubblingSortData)
    val myBubblingSortData=muBubblingSort(testData)
    println("myBubblingSortData = "+myBubblingSortData)
  }
  /*函数功能：冒泡排序*/
  def bubblingSort(inputData: ArrayBuffer[Int]): ArrayBuffer[Int] = {
    for (j <- 0 to inputData.length - 3)
      for (i <- 0 to inputData.length - 2 - j) {
        if (inputData(i) > inputData(i + 1)) {
          //判断前一个元素是否大于后一个，如果大于，则交换
          val temp = inputData(i + 1)
          inputData(i + 1) = inputData(i)
          inputData(i) = temp
        }
      }
    inputData
  }
}

2、快速排序

object QkSort {
  def main(args: Array[String]): Unit = {
    //    val testData = new ArrayBuffer[Int]
    //    testData += 10;testData += 101;testData += 75;testData += 3;testData += 9;testData += 12;testData += 77;testData += 86;testData += 99;testData += 25
    val testData = ArrayBuffer(10, 101, 75, 3, 9, 12, 77, 86, 99, 25)
    println("testData = "+testData)
    val qkSortData=qksort(testData)
    println("qkSortData = "+qkSortData)
    val myQkSortData=qksort(testData)
    println("myQkSortData = "+myQkSortData)

  }
  /*函数功能：快速排序*/
  def qksort(inputData: ArrayBuffer[Int]): ArrayBuffer[Int] = {
    def qs(inputData:ArrayBuffer[Int],left:Int,right:Int):Unit={
      if(left<right) {
        var i = left
        var j = right
        val x = in