C++二分查找在搜索引擎多文档求交的应用分析

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

intsearch2(intarray[],intn,intv)

{

intleft, right, middle;

left = 0, right = n - 1;

while(left <= right)

{

middle = (left + right) / 2;

if(array[middle] > v)

{

right = middle - 1;

}

elseif(array[middle] < v)

{

left = middle + 1;

}

else

{

returnmiddle;

}

}

return-1;

}

intsearch3(intarray[],intn,intv)

{

intleft, right, middle;

left = 0, right = n;

while(left < right)

{

middle = (left + right) / 2;

if(array[middle] > v)

{

right = middle;

}

elseif(array[middle] < v)

{

left = middle + 1;

}

else

{

returnmiddle;

}

}

return-1;

}