几个排序算法以及二分查找

冒泡排序

void bubblesort(int *a,int len)
{
	int i,j,temp;
	for(i=1;i<len;i++)
	{
		for(j=0;j<len-i;j++)
		{
			if(a[j]>a[j+1])    //从小到大排序
				{
					temp = a[j];
					a[j] = a[j+1];
					a[j+1] = temp;
				}
		}
	}
}

插入排序

void insertsort(int *a,int len)
{
	int i,j,temp;
	for(i=1;i<len;i++)
	{
		temp = a[i];
		for(j=i-1;j>=0 && a[j]>temp;j--)
		{
			
				a[j+1]=a[j];
			
		}
		a[j+1]=temp;
	}
}

快速排序

void quicksort(int *a,int low,int high)
{
	if(low < high)
	{
		int i = low;
		int j = high;
		int base = a[low];
		while(i<j)
		{
          while(i<j&&a[j]>=base)
          {
          	j--;
          }
          if(i<j)
          {
          	a[i++] = a[j];
          }
          while(i<j&&a[i]<=base)
          {
          	i++;
          }
          if(i<j)
          {
          	a[j--] = a[i];
          }
		}
		a[i] = base;
		quicksort(a,low,i-1);
		quicksort(a,i+1,high);
	}
}

希尔排序

void shellsort(int *a,int len)
{
	int i,j,temp,inc;
	for(inc=len/2;inc>0;inc=inc/2)
	{
		for(j=inc;j<len;j++)
		{
			temp=a[j];
			for(i=j-inc;i>=0&&temp<a[i];i-=inc)
			{
				a[i+inc]=a[i];
			}
			a[i+inc]=temp;
		}
	}
}

二分查找

void search(int *a,int left,int right,int x)
{
	int mid;
	while(left <= right)
	{
	  mid=(left+right)/2;
	  if(a[mid] > x)
         right = mid-1;
      if(a[mid] < x)
         left = mid+1;
      if(a[mid] == x)
         return mid;
	}
	return -1;
}