----------------------android培训、java培训、期待与您交流! ---------------------
1.关于交换2个元素的位置的方法
排序,位置置换功能抽取
所有排序中,“换位”的功能需求都是一样的,所以提取这部分功能相同的代码,单独封装成一个函数。
public static void swap(int[] arr, int a, int b)
{
int temp = arr[a];
arr[a] = arr[b];
arr[b] = temp;
// arr[a] = arr[a] ^ arr[b]; //利用疑惑运算符,提高效率,不使用中间变量。
// arr[b] = arr[a] ^ arr[b];
// arr[a] = arr[a] ^ arr[b];
}
2.有序数组的折半查找
public static int halfSearch(int[] arr, int key)
{
/* int max = arr.length-1; //注意-1,防止数组越界,ArrayIndexOutOfBoundsException
int min = 0;
int mid = (max+min)/2;//(max+min)>>1;
while(arr[mid]!=key)//while(min<=max)
{
if(min>=max)
return -1;
if(arr[mid]<key)
min = mid + 1;
else if(arr[mid]>key)
max = mid - 1;
mid = (max+min)/2;
}
return mid;
*/
int min = 0, max = arr.length-1, mid;
while(min<=max)
{
mid = (max+min)>>1;
if(key>arr[mid])
min = mid + 1;
else if(key<arr[mid])
max = mid - 1;
else
return mid;
}
return -1;
}
3.关于进制转换的优化
public static int halfSearch(int[] arr, int key)
{
/* int max = arr.length-1; //注意-1,防止数组越界,ArrayIndexOutOfBoundsException
int min = 0;
int mid = (max+min)/2;//(max+min)>>1;
while(arr[mid]!=key)//while(min<=max)
{
if(min>=max)
return -1;
if(arr[mid]<key)
min = mid + 1;
else if(arr[mid]>key)
max = mid - 1;
mid = (max+min)/2;
}
return mid;
*/
int min = 0, max = arr.length-1, mid;
while(min<=max)
{
mid = (max+min)>>1;
if(key>arr[mid])
min = mid + 1;
else if(key<arr[mid])
max = mid - 1;
else
return mid;
}
return -1;
}
-----------------------android培训、java培训、期待与您交流! ----------------------