java 排序算法

Java算法

快速排序

package com.algorithm.demo;

public class QuickSort {

	public int division (int[] list,int left,int right) {
		int base=list[left];
		while(left=base)
				right--;
			list[left]=list[right];
			while(left

冒泡排序

	public static void sort(int args[]) {
		int len=args.length;
		for (int i = 0; i args[j+1]) {
					int temp=args[j];
					args[j]=args[j+1];
					args[j+1]=temp;
				}
			}
		}
	}

选择排序

	public static void sort(int arg[]) {
		int len=arg.length;
		for (int i = 0; i arg[j]) {
					int temp=arg[i];
					arg[i]=arg[j];
					arg[j]=temp;
				}
			}
		}
	}