Java排序（冒泡排序、首尾倒置，动态数组、选择排序法、九九乘法表）

范例1：字符串排序（倒序）   

public class Demo01 {
	public static void main(String[] args) {
		String str = "HelloWorld";
		ReverseSort(str);
	}

	public static void ReverseSort(String str) {
		char[] data = str.toCharArray();
		int len = data.length / 2;
		int head = 0;
		int tail = data.length - 1;
		for (int i = 0; i <= len; i++) {
			char temp = data[head];
			data[head] = data[tail];
			data[tail] = temp;
			head++;
			tail--;
		}
		print(data);
	}

	public static void print(char[] data) {
		System.out.println(new String(data));
	}

}

================分割线================

范例2：数组排序（冒泡排序）    

public class Demo01 {
	public static void main(String[] args) {
		int[] data = new int[] { 11, 66, 14, 20, 13, 55 };
		BubbleSort(data);
	}

	public static void BubbleSort(int data[]) {
		int len = data.length;
		for (int i = 0; i < len; i++) {
			for (int j = 0; j < len - 1; j++) {
				if (data[j] > data[j + 1]) {
					int temp = data[j];
					data[j] = data[j + 1];
					data[j + 1] = temp;
				}
			}
		}
		print(data);

	}

	public static void print(int[] data) {
		for (int i : data) {
			System.out.print(i + " ");
		}
	}

}

================分割线================

范例3：数组倒序(普通方法:前后置换)

public class Demo01 {
	public static void main(String[] args) {
		int[] data = new int[] { 11, 66, 14, 20, 13, 55 };
		ReverseSort(data);
	}

	public static void ReverseSort(int data[]) {
		int len = data.length / 2;
		for (int i = 0; i < len; i++) {
			int temp = data[data.length - 1 - i];
			data[data.length - 1 - i] = data[i];
			data[i] = temp;
		}
		print(data);

	}

	public static void print(int[] data) {
		for (int i : data) {
			System.out.print(i + " ");
		}
	}

}

================分割线================

范例4：数组倒序(动态数组:前后置换)

import java.util.ArrayList;
import java.util.List;

public class Demo01 {
	public static void main(String[] args) {
		int[] data = new int[] { 11, 66, 14, 20, 13, 55 };
		ReverseSort(data);
	}

	public static void ReverseSort(int data[]) {
		List<Integer> all = new ArrayList<>();
		int len = data.length;
		for (int i = 0; i < data.length; i++) {
			all.add(data[len - 1 - i]);
		}
		Object[] obj = all.toArray();
		print(obj);
	}

	public static void print(Object[] data) {
		for (Object i : data) {
			System.out.print(i + " ");
		}
	}

}

================分割线================

范例5：数组排序（选择排序）

public class Demo01 {
	public static void main(String[] args) {
		int[] data = new int[] { 11, 66, 14, 33, 21, 55 };
		SelectSort(data);
	}

	public static void SelectSort(int[] data) {
		int len = data.length;
		for (int i = 1; i <= len; i++) {
			int index = 0;
			for (int j = 1; j <= len - i; j++) {
				if (data[index] < data[j]) {//筛选出最大的元素
					index = j;
				}
			}
			int temp = data[len - i];
			data[len - i] = data[index];
			data[index] = temp;
		}
		print(data);
	}

	public static void print(int[] data) {
		for (int i : data) {
			System.out.print(i + " ");
		}
	}
}

================分割线================

范例6：九九乘法表

public class Demo {
	public static void main(String[] args) {
		for (int x = 1; x <=9; x++) {
			for (int y = 1; y <=x; y++) {
				System.out.print(y+"*"+x+"="+x*y+"\t");
				
			}
			System.out.println();
		}
		
	}
}