/* ------------------------------------------------- 隣接交換法によるソート Sort01_rinsetu_koukan ------------------------------------------------- */ import java.io.*; class Sort01_rinsetu_koukan { static final int youso=5; static int[] su=new int[youso]; // ---------------- mainメソッド -------------------- public static void main(String[] args) throws Exception { num_input(); num_sort(); num_display(); } // ---------------- num_inputメソッド -------------------- static void num_input() throws Exception { int i; System.out.print(youso+"個の数字をソートします\n"); BufferedReader inp=new BufferedReader (new InputStreamReader(System.in)); String keybd; for ( i=0 ; i<=youso-1 ; i++ ){ System.out.print("No."); System.out.print(i+1); System.out.print("-->"); keybd=inp.readLine(); su[i]=Integer.parseInt(keybd); } return; } // ---------------- num_sortメソッド -------------------- static void num_sort() throws Exception { int n,k,w; n = youso - 1; while (n>0) { k=0; while (k su[k+1] ) { w = su[k]; su[k] = su[k+1]; su[k+1] = w; } k++; } n--; } return; } // ---------------- num_displaytメソッド -------------------- static void num_display() throws Exception { int i; System.out.print("\n小さい順に表示します\n"); for ( i=0 ; i<=youso-1 ; i++ ){ System.out.print(su[i]+" "); } System.out.print("\n"); return; } }