insertionsort in scala

gistfile1.scala

  val r = new scala.util.Random()                 
  val data = List.fill(10)(r.nextInt(100))        

  def isort(xs: List[Int]): List[Int] = {

    def insert(x: Int, xs: List[Int]): List[Int] = xs match {
      case List() => List(x)
      case y :: ys => if (x < y) x :: y :: ys else y :: insert(x, ys)
    }

    xs match {
      case List() => xs
      case y :: ys => insert(y, isort(ys))
    }
  }                                               

  isort(data)