JAVA冒泡、插入、选择排序算法(2)

经常在笔试(或面试)中出现的JAVA经典算法,本人特此整理,希望有用

} } } if (a[position] > a[j]) { int temp = a[position]; a[position] = a[j]; a[j] = temp; } System.out.println("\n" + "采用选择排序法："); public void Print(int a[]) { System.out.println("从小到大排序结果为："); for (int i = 0; i < a.length; i++) { System.out.print(a[i] + ","); } } public static void main(String[] args) { int a[] = new int[5]; Paixu px = new Paixu(); BufferedReader buf = new BufferedReader( new InputStreamReader(System.in)); System.out.println("请输入五个整数："); for (int i = 0; i < a.length; i++) { try { String s = buf.readLine(); int j = Integer.parseInt(s); a[i] = j; } catch (Exception e) { System.out.println("出错了！必须输入整数,请重新输入!");

i--; } } System.out.println("您输入的整数依次为："); for (int i = 0; i < a.length; i++) { System.out.print(a[i] + ","); }