kdboy的专栏

全排列是对指定的组数按一定顺序进行排列。如果这组数有n个，那么全排列数为n!个。 算法：以前k个元素为前缀，对剩余元素进行全排列。 [code="java"]public class Perm { public static void main(String args[]) { String a[] = { "A", "B", "C", "D" }; print(a...

[color=blue]一、冒泡排序[/color] [code="java"] public void bubbleSort(int[] a) { int temp; for (int i = a.length - 1; i > 1; i--) { for (int j = 0; j < i; j++) { if (a[j] > a[j + 1]) { ...

[code="java"] public int binarySearch(int[] a, int searchKey) { int lowerBound = 0; int upperBound = a.length - 1; int curIn; while (true) { curIn = (lowerBound + upperBound) / 2; ...