zhebanchazhao.cpp

关于数据结构的各章节的c原代码实现

// zhebanchazhao.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <stdio.h>
int node[10]={1,3,4,7,8,9,12,23,45,65};
int halffind(int low,int high,int e)
{
int mid;
mid=(low+high)/2;
if (low<=high)
{
	if(e>node[mid]){low=mid+1;halffind(low,high,e);}
	else if(e<node[mid]){high=mid-1;halffind(low,high,e);}
	else
    return mid;
}
else
  return -1;
}
int main(int argc, char* argv[])
{   
	int low,high,e,f;
	low=0;
	high=9;
    printf("请输入要查找的数：");
	scanf("%d",&e);
	f=halffind(low,high,e);
    if(f<0)printf("no find!");
	 else printf("是第%d号元素",f+1);
	return 0;
}