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 t

猜你喜欢

转载自blog.csdn.net/s294878304/article/details/114845419
今日推荐