int main()
{
int arr[10] = { 1,3,6,2,4,5,7,9,8,10 };//升序,改降序
int i = 0;
int j = 0;
//先不要函数排序
int sz = sizeof(arr) / sizeof(arr[0]);
for (i = 0; i < sz - 1; i++)
{
for (j = 0; j < sz - 1 - i; j++)
{
if (arr[j] < arr[j + 1])
{
int tem = arr[j];
arr[j] = arr[j+1];
arr[j+1] = tem;
}
}
}
for (i = 0; i < sz; i++)
{
printf("%d ", arr[i]);
}
return 0;
}
//函数来排序
void bubble_sort(int arr[], int sz)//要么就写数组arr[],要么就写*arr(数组指针)
{
int i = 0;
int j = 0;
for (i = 0; i < sz - 1; i++)
{
for (j = 0; j < sz - 1 - i; j++)
{
if (arr[j]>arr[j + 1])//大于符号是升序,小于符号是降序
{
int tem = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = tem;
}
}
}
}
int main()
{
int i = 0;
int arr[10] = { 1,3,5,7,9,10,8,6,4,2 };
int sz = sizeof(arr) / sizeof(arr[0]);
bubble_sort(arr, sz);
for (i = 0; i < sz; i++)
{
printf("%d ", arr[i]);
}
return 0;
}
二分查找:
不要函数版
int main()
{
int arr[10] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 0;
scanf("%d", &k);
int sz = sizeof(arr) / sizeof(arr[0]);
int left = 0;
int right = sz - 1;
int mid = 0;
while (left <= right)
{
mid = (left + right) / 2;
if (arr[mid] < k)
{
left = mid + 1;
}
else if (arr[mid] > k)
{
right = mid - 1;
}
else
{
break;
}
}
if (left>right)
{
printf("找不到");
}
else
{
printf("找到了,下标是:%d", mid);
}
return 0;
}
函数版:
int search(int arr[], int k, int sz)
{
int left = 0;
int right = sz - 1;
while (left <= right)
{
int mid = left + (right - left) / 2;
if (arr[mid] < k)
{
left = mid + 1;
}
else if (arr[mid] > k)
{
right = mid - 1;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 0;
scanf("%d", &k);
//找得出来就返回,找不出来返回负数
int sz = sizeof(arr) / sizeof(arr[0]);
int ret = search(arr, k, sz);
if (ret == -1)
{
printf("找不到");
}
else
{
printf("找到了,下标是:%d", ret);
}
return 0;
}