文件名称:erfenchazhao
介绍说明－－下载内容均来自于网络，请自行研究使用
//输入一个整形的数组int[] a，与需要查找的int key,
//返回key经过排序后的下标（索引值），可以但没有改进为之前的下标
//对多个key来讲，只能返回一个,应该很容易但是没有实现返回所有的key的下标
//如果找不到，则返回-1
//不足之处是要先排序-//Enter a plastic array int [] a, and the need to find int key,// return key after the post-sort subscr ipt (index value), can be improved but not before the subscr ipt// on a number key to speaking, only to return one should be easy to achieve but did not return the key to all of the subscr ipt// If you can not find, then return-1// deficiencies is to sort
//返回key经过排序后的下标（索引值），可以但没有改进为之前的下标
//对多个key来讲，只能返回一个,应该很容易但是没有实现返回所有的key的下标
//如果找不到，则返回-1
//不足之处是要先排序-//Enter a plastic array int [] a, and the need to find int key,// return key after the post-sort subscr ipt (index value), can be improved but not before the subscr ipt// on a number key to speaking, only to return one should be easy to achieve but did not return the key to all of the subscr ipt// If you can not find, then return-1// deficiencies is to sort
(系统自动生成,下载前可以参看下载内容)
下载文件列表
二分查找.java