10.1作业

二分查找+快排(代码)

#include <stdio.h>
#include <string.h>
int half_sort(int arr[],int low,int high,int key)
{
	while(low<=high)
	{
		int mid=(low+high)/2;
		if(key>arr[mid])
			low=mid+1;
		if(key<arr[mid])
			high=mid-1;
		if(key==arr[mid])
			return mid;
	}
	return -1;
}
int main(int argc, const char *argv[])
{
	int arr[8]={14,5,6,32,8,20,37,55};
	int key;
	printf("please input:");
	scanf("%d",&key);
	int flag=half_sort(arr,0,sizeof(arr)/sizeof(arr[0]),key);
	if(flag==-1)
	puts("error");
	else
	printf("在下标%d处\n",flag);
	return 0;
}//二分查找




#include <stdio.h>
#include <string.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[]={15,45,26,93,1,7,34,4};
	quick_sort(arr,0,sizeof(arr)/sizeof(arr[0]));
	for(int i=0;i<sizeof(arr)/sizeof(arr[0]);i++)
	{
		printf("%d\t",arr[i]);
	}
	puts("");
	return 0;
}//快速排序