Java（位移的应用）

 ---------- 位移的应用

折半查找。提高效率，但是必须要保证该数组是有序的数组。

public static int halfSearch(int[] arr,int key){
int min=0,max=arr.length-1,mid;

while(min<=max){//只要有距离就能折半，只要min小于等于max就能折半
  mid =(max+min)>>1;//折半  等于mid=(max+min)/2;
  if(key>arr[mid])
min = mid+1;
  else if(key
maxx=mid-1;
  else
   return mid;
}
return -1;//代表角标不存在，数也不存在，没有被找到
}
int [] arr={2,4,5,7,19,32,45};
int index = halfSearch(arr,320);
System.out.println("index="+index);

public static int halfSearch(int[] arr,int key){
int min=0,max=arr.length-1,mid;

while(arr[mid]!=key){
if(key>arr[mid])
min=mid+1;
else if(key<arr[mid])
max=mid-1;
if(min>max)//没有折半可能
return -1;
mid=(max+min)/2;
}
return mid;

 

---------------------------------------------------

二进制

package cn.itheima;

public class ArrayTest {

public static void main(String[] args) {
// TODO Auto-generated method stub
toBin(6);
}

private static void toBin(int num) {
// TODO Auto-generated method stub
StringBuffer sb = new StringBuffer();//存储数据的容器
while(num>0){
sb.append(num%2);//添加功能
num=num/2;
}
System.out.println(sb.reverse());//反向打印
}

}

 

-------------------------------------------------------------

抽取固定模块

package cn.itheima;

public class ArrayTest {

public static void main(String[]args) {
// TODO Auto-generated methodstub
toBin(-6);
}

private static void toBin(int num){
// TODO Auto-generated methodstub
trans(num,1,1);//二进制
trans(num,15,4)//十六进制
trans(num,7,3)//八进制
}

private static void trans(int num,int base, int offset) {
// TODO Auto-generated methodstub
if(num==0)
{
System.out.println(0);
return ;
}
char[] chs= {'0','1','2','3',
'4','5','6','7',
'8','9','A','B',
'C','D','E','F',
};
char[] arr = new char[32];
int pos = arr.length;
while(num!=0){
int temp=num&base;//与操作
arr[--pos]= chs[temp];//查表
num=num>>>offset;
}
for(int x=pos;x<arr.length;x++)
System.out.println(arr[x]);
}
}

}