摘要: 摘抄自:http://www.cnblogs.com/forlina/archive/2011/08/03/2126292.html 1.完成数组int[] a = {100,40, 60, 87, 34, 11, 56, 0}的快速排序、冒泡排序; 2.采用折半查找的算法,在数组中查询到某个数; 阅读全文
posted @ 2012-10-05 11:15 逃离沙漠 阅读(1530) 评论(0) 推荐(0) 编辑