1.二分法 private int middleSort(int[] arry) { int high = arry.length; int low = 0; while (low <= high) { int mid = (low + high) / 2; if (arry[mid] == STAN

转载地址：http://www.cnblogs.com/franksunny/archive/2012/04/17/2453403.html Activity、Task、应用和进程  为了阅读方便，将文档转成pdf  http://files.cnblogs.com/franksunny/ActivityTask%E5%BA%94%E7%94%A8%E5%92%8C%E8%BF%9B

参考：http://www.cnblogs.com/icejoywoo/archive/2012/10/15/2724674.html 1、信号量Sephmore public class SyncThreadTest { private static Semaphore A = new Semaphore(1); private static Semaphore B = new Sem