java实现排序算法

来源：互联网发布：java方法签名异常编辑：程序博客网时间：2024/05/29 09:15
package com;public class SortClass {public static void main(String[] args) {int[] hh = {1,8,3,3,4,6,5};bubbleSort(hh);selectSort(hh);insertSort(hh);}/** * 冒泡排序 * @param numbers */public static void bubbleSort(int[] numbers) {int temp; //临时记录中间值int size = numbers.length;for (int i = 0; i < size-1 ; i++) {for (int j = i+1; j < size; j++) {if (numbers[i] < numbers[j]) {temp = numbers[i];numbers[i] = numbers[j];numbers[j] = temp;}}}String result = "";for (int i : numbers) {result += i +"";}System.out.println(result);}/** * 选择排序 * @param numbers */public static void selectSort(int[] numbers) {int temp;int size = numbers.length;for (int i = 0; i < size; i++) {int k = i;for (int j = size - 1; j > i ; j--) {if (numbers[j] < numbers[k]) {k = j;}}temp = numbers[i];numbers[i] = numbers[k];numbers[k] = temp;}String result = "";for (int i : numbers) {result += i +"";}System.out.println(result);}/** * 插入排序 */public static void insertSort(int[] numbers) {int temp;int size = numbers.length;int j;for (int i = 0; i < size; i++) {temp = numbers[i];for (j = i; j > 0 && temp < numbers[j-1]; j--) {numbers[j] = numbers[j-1];  }numbers[j] = temp; }String result = "";for (int i : numbers) {result += i +"";}System.out.println(result);}}
0 0