Scala实现：冒泡排序

package DataStructureAndAlgorithm

/**
  * Created by jiangzl on 2016/10/28.
  */
object BubbleSort {

  // 外层循环做拆分
  def bubbleSort(l: List[Int]): List[Int]  = l match {
    case List() => List()
    case head :: tail => bSort(head, bubbleSort(tail))
  }
  // 内层循环做排序
  def bSort(data: Int, dataSet: List[Int]): List[Int] = dataSet match {
    case List() => List(data)
    case head :: tail => if (data <= head) data :: dataSet else head :: bSort(data, tail)
  }

  def main(args: Array[String]) {
    val list = List(3, 12, 43, 23, 7, 1, 2, 20)
    println(bubbleSort(list))
  }
}

List(1, 2, 3, 7, 12, 20, 23, 43)