【数据结构】堆排序 -> 折半查找

#include < iostream >
using namespace std;

#define NUM 10

// 一个节点的排序
void heappass(int a[],int i, int m)
{

int temp = a[i];  // 保存要转移的根结点的值 
int j = 2*i;
int flag = 0;  // 当前结点大于等于孩子结点的标志，若大于，置为1

while(j<=m && !flag){
	if(j<m && a[j]<a[j+1])
	    ++j;
	if(temp>=a[j]) flag = 1;
	else{
		a[i] = a[j];
		i = j;
		j = 2*j;
	}	
} 
a[i] = temp;

}

// 堆排序
void heapsort(int a[], int n)
{

int temp, i;
for(i=n/2;i>=1;i--){
	heappass(a,i,n);
}
for(i=n;i>=2;i--){
	temp = a[1];
	a[1] = a[i];
	a[i] = temp;
	heappass(a,1,i-1);
}

}

// 折半查找（非递归）
int BSearch1(int a[], int n, int key)
{

int mid, low, high;
low = 1;
high = n;
while(low<=high){
	mid = (high+low)/2;
	if(key==a[mid]) return mid;
	else if(key<a[mid]) high = mid-1;
	else low = mid+1;
}
return 0;

}

// 折半查找（递归）
int BSearch2(int a[],int low,int high,int key)
{

if(low>high) return 0;
int mid = (high+low)/2;
if(key==a[mid]) return mid;
else if(key<a[mid]) return BSearch2(a,low,mid-1,key);
else return BSearch2(a,mid+1,high,key);

}

int main()
{

int a[NUM+1] = {-1,4,7,0,9,8,2,3,1,5,6};  // 第一个元素不存放
heapsort(a,NUM); 
for(int i=1;i<=NUM;i++){
	cout<<a[i]<<" ";
}
cout<<endl;
cout<<BSearch1(a,NUM,8)<<endl;
cout<<BSearch2(a,1,NUM,8)<<endl;
return 0;

}