快速排序、冒泡排序、以及二分法查找
1.冒泡排序
public static void BubblingSort(int[] array)
{
for (int i = 0; i < array.Length; i++)
{
for (int j = i; j < array.Length; j++)
{
if (array[i] > array[j])
{
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
}
Debug.Log("array=" + array[i]);
}
2.快速排序
public static void DichotomySort(int[] array)
{
for (int i = 0; i < array.Length; i++)
{
int start = 0;
int end = i - 1;
int middle = 0;
int temp = array[i];
while (start <= end)
{
middle = (start + end) / 2;
if (array[middle] > temp)//要排序元素在已经排过序的数组左边
{
end = middle - 1;
}
else
{
start = middle + 1;
}
}
for (int j = i - 1; j > end; j--)//找到了要插入的位置,然后将这个位置以后的所有元素向后移动
{
array[j + 1] = array[j];
}
array[end + 1] = temp;
}
3.二分法查找
public static int BinarySearch(int[] arr, int value)
{
int low = 0;
int high = arr.Length - 1;
while (low <= high)
{
//
int middle = (low + high) / 2;
//如果要查找的对像等于middle
if (value == arr[middle])
{
return middle;//如果找到了就直接返回这个元素的索引
}
else if (value > arr[middle])
{
low = middle + 1;
}
else
{
high = middle - 1;
}
}
return -1;//如果找不到就返回-1;
}
}