//折半2015.7.13 02:38
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#define MAXSIZE 10000
typedef struct seqNode
{
int data[MAXSIZE];
int n;
}seqNode;
void createSeq(seqNode *& seq)
{
seq=(seqNode *)malloc(sizeof(seqNode));
for(int i=0;i<MAXSIZE;i++)
{
seq->data[i]=i+1;
// printf("%d\n",seq->data[i]);
}
}
int divideDouble(seqNode * seq,int x)
{
int left=0;
int right=MAXSIZE-1;
int mid=-1;
while(right>=left)
{
mid=(right+left)/2;
if((seq->data[mid])>x)
{
right=mid-1;
}
else if((seq->data[mid])<x)
{
left=mid+1;
}
else
return mid;
}
return -1;
}
int main()
{
seqNode * seqList=NULL;
createSeq(seqList);
int dd=divideDouble(seqList,33);
if(dd!=-1)
printf("位置为%d",dd);
else
printf("查找失败\n");
return 0;
}
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#define MAXSIZE 10000
typedef struct seqNode
{
int data[MAXSIZE];
int n;
}seqNode;
void createSeq(seqNode *& seq)
{
seq=(seqNode *)malloc(sizeof(seqNode));
for(int i=0;i<MAXSIZE;i++)
{
seq->data[i]=i+1;
// printf("%d\n",seq->data[i]);
}
}
int divideDouble(seqNode * seq,int x)
{
int left=0;
int right=MAXSIZE-1;
int mid=-1;
while(right>=left)
{
mid=(right+left)/2;
if((seq->data[mid])>x)
{
right=mid-1;
}
else if((seq->data[mid])<x)
{
left=mid+1;
}
else
return mid;
}
return -1;
}
int main()
{
seqNode * seqList=NULL;
createSeq(seqList);
int dd=divideDouble(seqList,33);
if(dd!=-1)
printf("位置为%d",dd);
else
printf("查找失败\n");
return 0;
}