冒泡排序 和 折半查找

#include<iostream>
using namespace std;


void swap(int* a, int* b)
{
int t = *a;
*a = *b;
*b = t;
}


void print(int array[], int len)
{
for (int i = 0; i < len; i++)
cout << array[i] << " ";
cout << endl;
}
void bubble_asc(int array[], int len)
{
int i, j;
for (i = 0; i < len -1; i++)
for (j = i+1; j < len; j++)
{
if (array[i] > array[j])
swap(&array[i], &array[j]);
}
print(array, len);
}


void bubble_desc(int array[], int len)
{
int i, j;
for (i = len - 1; i > 0; i--)
for (j = i - 2; j >=0; j--)
{
if (array[i] > array[j])
swap(&array[i], &array[j]);
}
print(array, len);
}


int half_search(int array[], int low, int high, int e)
{
while ( low <= high)
{
int middle = ( low + high) / 2;
if (array[middle] > e) low = middle + 1;
if (array[middle] < e) high = middle - 1;
if (array[middle] == e) return middle;
}
return -1;
}
void main()
{
int array[] = {1,23, 45,21,15,28,26,203,102};
bubble_asc(array, sizeof(array) / sizeof(int));
bubble_desc(array, sizeof(array) / sizeof(int));


int index = half_search(array, 0, sizeof(array) / sizeof(int), 21);
if (index == -1)  cout << " not find ..." <<endl;
else cout << index <<endl;
}