Cacher is the code snippet organizer for pro developers

import scala.io._

object Main extends App {
  val n = StdIn.readInt
  val list = readLine.split(" ").map(_.toInt).toList
  val sortedList = ssort(list)
  println(sortedList.mkString(" "))

  def foward(list: List[Int]): List[Int] = {
    if(list == Nil){
      Nil
    }else{
      // もちろん list.min というListの最小値を求める関数もアリ
      val minValue = list.foldLeft(Int.MaxValue){(preMin, n) => Math.min(preMin, n)}
      if(list.head != minValue){
        // 最小値を先頭にし、残りの要素は元のリストから最小値のdiff(集合の差)を取ったリスト。
        minValue :: (list diff List(minValue))
      }else{
        list
      }
    }
  }

  def ssort(list: List[Int]): List[Int] = {
    list match{
      case Nil => Nil
      case List(x) => List(x)
      case xs =>
      foward(xs) match{
        case Nil => Nil
        case y :: ys =>
          y :: ssort(ys)
      }
    }
  }
}

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int A[] = new int[100];

        for(int i=0;i<n;i++){
            A[i] = scan.nextInt();
        }
        int count=0;
        int minj;
        int i, j;
        for(i=0;i<n-1;i++){
            minj = i;
            for(j=i;j<n;j++){
                if(A[minj] > A[j]){
                    minj = j;
                }
            }
            if(i != minj){
                int tmp;
                tmp = A[i];
                A[i] = A[minj];
                A[minj] = tmp;
                count++;
            }

        }
        printArray(A, n);
        System.out.println(count);
    }

    // スペース区切りで表示
    public static void printArray(int A[], int n){
        int i;
        for(i=0;i<n-1;i++){
            System.out.print(A[i] + " ");
        }
        System.out.println(A[i]);
    }
}