3,插入排序
public class InsertSortImpl { /** * @param args */ public static void InsertSort(int A[]) { int n = A.length; for (int i = 0; i < n-1; i++) { int temp = A[i+1]; Insert(A, temp, i ); } } public static void Insert(int A[], int e, int k) {// 对A[1...k]排序 while(k>=0&&A[k]>e){ A[k+1]=A[k]; k--; } A[k+1]=e; } public static void main(String[] args) { // TODO Auto-generated method stub int A[] = new int[] { 2, 5, 3, 9, 7, 1, 30,6 }; InsertSort(A); for (int i = 0; i < A.length; i++) { System.out.println(A[i]); } } } |
4,快速排序
import java.util.Random; public static void QuickSort(int A[], int left, int right) { while(A[left]<pivot) { if(left<right){ |