package com.hwq.test;
public class InsertSort
{
/**
* @param args
*/
public static void main(String[] args)
{
//int[] arr = {3,5,4,2,8,6,9};
int[] arr = {3,5,11,17,21,23,28,30,32,50,64,78,81,95,101};
int f = binSearch(arr,17);//返回3
System.out.println(f);
//doInsertSort(arr);
}
private static void doInsertSort(int[] arr)
{
for (int i = 0; i < arr.length; i++)//4
{
int j;//3,5,4,2,8,6,9
int temp = arr[i];//8
for (j = i;j > 0; j--)//321
{
if(arr[j - 1] > temp)//2>8
{
arr[j] = arr[j - 1];//8=2/3542889
}
else
{
break;
}
}
arr[j] = temp;//2=8/3548889
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]);
}
}
public static int binSearch(int srcArray[], int key)
{
int low = 0;
int high = srcArray.length - 1;
while(low < high)
{
int middle = (low + high)/2;
if(key == middle)
{
return middle;
}
else if(key < srcArray[middle])
{
high = middle - 1;
}
else
{
low = middle + 1;
}
}
return -1;
}
// int mid = srcArray.length / 2;
// if (key == srcArray[mid])
// {
// return mid;
// }
// int start = 0;
// int end = srcArray.length - 1;
// while (start <= end)
// {
// mid = (end - start) / 2 + start;
// if (key < srcArray[mid])
// {
// end = mid - 1;
// }
// else if (key > srcArray[mid])
// {
// start = mid + 1;
// }
// else
// {
// return mid;
// }
// }
// return -1;
// }
}
public class InsertSort
{
/**
* @param args
*/
public static void main(String[] args)
{
//int[] arr = {3,5,4,2,8,6,9};
int[] arr = {3,5,11,17,21,23,28,30,32,50,64,78,81,95,101};
int f = binSearch(arr,17);//返回3
System.out.println(f);
//doInsertSort(arr);
}
private static void doInsertSort(int[] arr)
{
for (int i = 0; i < arr.length; i++)//4
{
int j;//3,5,4,2,8,6,9
int temp = arr[i];//8
for (j = i;j > 0; j--)//321
{
if(arr[j - 1] > temp)//2>8
{
arr[j] = arr[j - 1];//8=2/3542889
}
else
{
break;
}
}
arr[j] = temp;//2=8/3548889
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]);
}
}
public static int binSearch(int srcArray[], int key)
{
int low = 0;
int high = srcArray.length - 1;
while(low < high)
{
int middle = (low + high)/2;
if(key == middle)
{
return middle;
}
else if(key < srcArray[middle])
{
high = middle - 1;
}
else
{
low = middle + 1;
}
}
return -1;
}
// int mid = srcArray.length / 2;
// if (key == srcArray[mid])
// {
// return mid;
// }
// int start = 0;
// int end = srcArray.length - 1;
// while (start <= end)
// {
// mid = (end - start) / 2 + start;
// if (key < srcArray[mid])
// {
// end = mid - 1;
// }
// else if (key > srcArray[mid])
// {
// start = mid + 1;
// }
// else
// {
// return mid;
// }
// }
// return -1;
// }
}