数据结构——BinarySearch两种方法的代码实现

最新推荐文章于 2023-04-03 23:44:04 发布

「已注销」

最新推荐文章于 2023-04-03 23:44:04 发布

阅读量1k

点赞数

分类专栏：数据结构文章标签：代码笔记 C++

本文链接：https://blog.csdn.net/KeLThuzAD57/article/details/69387948

版权

本文主要介绍了如何使用C++实现二分查找，包括详细步骤和代码示例，参考书籍为《Data Structures and Program Design in C++》。内容涵盖了二分查找在有序列表中的应用。

摘要由CSDN通过智能技术生成

Reference Book: 《Data Structures and Program Design in C++》

---------------------------------------------------------------------------------------------------------------------------------------------------

1. Double_Linked_List见文章Double_Linked_List代码实现

2. (1) Record.h

#ifndef RECORD_H
#define RECORD_H

#include <iostream>

using namespace std;

typedef int Key_type;
typedef Key_type Record_type;
class Key
{
    private:
        Key_type key;

    public:
        static Key_type comparisons;
        Key(int x=0);
        Key_type the_key()const;

};
bool operator == (const Key &x, const Key &y);
bool operator > (const Key &x, const Key &y);
bool operator < (const Key &x, const Key &y);
bool operator >= (const Key &x, const Key &y);
bool operator <= (const Key &x, const Key &y);
bool operator != (const Key &x, const Key &y);
ostream &operator << (ostream &output, Key &x);
/*
class Record
{
    public:
        Record(int x=0, int y=0);
        int the_key()const;

    protected:

    private:
        int key;
        int other;
};
*/
#endif // RECORD_H

2. (2) Record.cpp

#include "Record.h"

int Key::comparisons = 0;
Key::Key(int x)
{
    key = x;
}

Key_type Key::the_key()const
{
    return key;
}

bool operator == (const Key &x, const Key &y)
{
    Key::comparisons++;
    return x.the_key()==y.the_key();
}

bool operator > (