二分查找，希尔排序和快速排序

///二分查找
int binary_search( int array[],int value,int size )
{
int found = 0;
int high = size,low = 0,mid;
mid = ( high + low )/2;
printf( "\n\nlooking for %d\n",value );
while ( ( !found ) && ( high >= low ) )
{
printf("low %d Mid %d High %d\n",low,mid,high );
if ( value == array[mid])
{
found = 1;
}
else if ( value < array[mid] )
{
high = mid -1; 
}
else
low = mid + 1;
mid = (high + low)/2;
}
return found ? mid : -1;

}

///希尔排序法
void shell_sort( int array[],int size )
{
int temp,gap,i,exchange_occurred;
gap = size/2;
do 
{
do 
{
exchange_occurred = 0;
for ( i = 0;i<size-gap;i++ )
{
if ( array[i]>array[i+gap] )
{
temp =array[i];
array[i] = array[i+gap];
array[i+gap] = temp;
exchange_occurred = 1;
}
}
} while ( exchange_occurred );
} while ( gap /= 2 );
}


///快速排序
void quick_sort( int array[],int first,int last )
{
int temp,low,high,list_separator;


low = first;
high = last;
list_separator = array[ (first + last)/2 ];
do 
{
while ( array[low] < list_separator )
{
low++;
}
while ( array[high] > list_separator )
{
high--;
}
if ( low <= high )
{
temp = array[low];
array[ low++ ] = array[high];
array[ high-- ] = temp;
}
} while ( low<=high);
if ( first < high )
{
quick_sort(array,first,high);
}
if ( low < last )
{
quick_sort(array,low,last);
}
}

非常经典的算法总结，希望大家讨论