BubbleSort.scala

def getLargest[T <% Ordered[T]](data: List[T]): (T, List[T]) =
  data match {
    case head :: Nil  => (head, Nil)
    case head :: tail =>
      val (large, remaining) = getLargest(tail)
      if (large > head)
        (large, head :: remaining)
      else
        (head, large :: remaining)
  }

def bubbleSort[T <% Ordered[T]](data: List[T]): List[T] =
  data match {
    case Nil => Nil
    case _   =>
      val (greatest, tail) = getLargest(data)
      bubbleSort(tail) ::: List(greatest)
  }