一、冒泡排序算法
void BubbleSort(int[] array)
{
for(int i=1;i<array.Length;i++)
{
for(int j=0;j<array.Length-i;j++)
{
if(array[j]>array[j+1])
{
int temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
}
}
}
}
二、二分法查找算法(需要先排序)
int BinarySearch(int[] array,int value)
{
int low=0;
int high = array.Length-1;
int middle=0;
while(low <= high)
{
middle = (low + high)/2;
if(array[middle]==value)
{
return middle;
}
if(value < array[middle])
{
high = middle - 1;
}
else
{
low = middle + 1;
}
}
return -1;
}