快排 二分查找 2023.10.1

快排

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int one_sort(int arr[],int low,int high)
{
    int key=arr[low];
    while(low<high)
    {
        while(low<high && key<=arr[high])
            high--;
        arr[low]=arr[high];
        while(low<high&&key>=arr[low])
            low++;
        arr[high]=arr[low];
    }
    arr[low]=key;
    return low;
}
void quick_sort(int arr[],int low,int high)
{
    if(low>=high)
       return;

    int mid=one_sort(arr,low,high);
    quick_sort(arr,low,mid-1);
    quick_sort(arr,mid+1,high);

}
int main(int argc, const char *argv[])
{
    int arr[]={12,35,233,555,211,5213};
    quick_sort(arr,0,sizeof(arr)/sizeof(arr[0])-1);
    for(int i=0;i<sizeof(arr)/sizeof(arr[0]);i++)
    {
        printf("%d\t",arr[i]);
    }
    return 0;
}

二分查找

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int half(int arr[],int key,int low,int high)
{
	while(low<=high)
	{
		int mid=(low+high)/2;
			if(key>arr[mid])
				low=mid+1;
			else if(key<arr[mid])
				high=mid-1;
			else
			return mid;
	}
	return -1;
}
int zheban(int arr[],int key,int low,int high)
{
	int mid=(low+high)/2;
	if(low>high)
		return -1;
	else if(key>arr[mid])
		return zheban(arr,key,mid+1,high);
	else if(key<arr[mid])
		return zheban(arr,key,low,mid-1);
	else
		return mid;

}
int main(int argc, const char *argv[])
{
	int arr[]={11,22,54,23,12,51,899};
	int key;
	int len=sizeof(arr)/sizeof(arr[0]);
	printf("请输入key\n");
	scanf("%d",&key);
	int flag=zheban(arr,key,0,len-1);
		if(flag==-1)
			puts("error\n");
		else
			printf("在%d下标\n",flag);
	return 0;
}