整理几个排序算法

来源：互联网发布：android颜色选择器源码编辑：程序博客网时间：2024/05/05 23:19

一：冒泡排序

import java.util.Random;
public class Bubble {
public static void main(String[] args) {
  // TODO Auto-generated method stub
  int s[] = new int[10];

  Random rd = new Random();

  for(int i=0;i<s.length;i++){
   s[i] = rd.nextInt(100);
   System.out.print("   " + s[i]);
  }

  for(int i=0;i<s.length-1;i++){
   for(int j=0;j<s.length-i-1;j++){
    if(s[j] > s[j+1]){
     int temp = s[j];
     s[j] = s[j+1];
     s[j+1] = temp;
    }
   }
  }
  System.out.println("   ");
  for(int i=0;i<s.length;i++){
   System.out.print("   " + s[i]);
  }
}

}

二：选择排序

import java.util.*;
public class Select {

/**
* @param args
*/
public static void main(String[] args) {
  // TODO Auto-generated method stub
  int s[] = new int[10];

  Random rd = new Random();
  for(int i=0;i<s.length;i++){
   s[i] = rd.nextInt(100);
  }

  for(int i=0;i<s.length-1;i++){
   int min = s[i];
   int index = i;
   for(int j=i+1;j<s.length;j++){
    if(min > s[j]){
     min = s[j];
     index = j;
    }
   }
   s[index] = s[i];
   s[i] = min;
  }

  for(int i=0;i<s.length;i++){
   System.out.print("   " + s[i]);
  }
}

}

三：插入排序

import java.util.*;
public class Insert {

/**
* @param args
*/
public static void main(String[] args) {
  // TODO Auto-generated method stub
  int s[] = new int[10];

  Random rd = new Random();
  for(int i=0;i<s.length;i++){
   s[i] = rd.nextInt(100);
  }
  for(int i=1;i<s.length;i++){
   int insert_val = s[i];
   int index = i-1;

   while(index>=0 && insert_val<s[index]){
    s[index+1] = s[index];
    index--;
   }
   s[index+1] = insert_val;
  }
  for(int i=0; i<s.length;i++){
   System.out.print( " " + s[i] );
  }

}

}