C++ vector实现二分查找法
来源:互联网 发布:淘宝等级权限 编辑:程序博客网 时间:2024/05/09 23:26
#include<iostream>
#include<vector>
using namespace std;
using std::vector;
int main()
{
vector<int> text{54,87,575,4587,54245,54255,58655,59654,60000,60555,65588};
auto beg = text.begin();
auto end = text.end();
auto mid = text.begin() + (end - beg) / 2;
int sought = 60555;
while (mid != end && *mid != sought)
{
if (sought < *mid)
{
end = mid;
for (auto it = beg; it != mid; it++)
cout << *it << " ";
}
else
{
beg = mid + 1;
for (auto it = beg; it != end; it++)
cout << *it << " ";
}
mid = beg + (end - beg) / 2;
cout << endl;
}
cout << "position:" <<&mid<< endl;
cout << "search element:"<<*mid << endl;
cin.get();
return 0;
}
#include<vector>
using namespace std;
using std::vector;
int main()
{
vector<int> text{54,87,575,4587,54245,54255,58655,59654,60000,60555,65588};
auto beg = text.begin();
auto end = text.end();
auto mid = text.begin() + (end - beg) / 2;
int sought = 60555;
while (mid != end && *mid != sought)
{
if (sought < *mid)
{
end = mid;
for (auto it = beg; it != mid; it++)
cout << *it << " ";
}
else
{
beg = mid + 1;
for (auto it = beg; it != end; it++)
cout << *it << " ";
}
mid = beg + (end - beg) / 2;
cout << endl;
}
cout << "position:" <<&mid<< endl;
cout << "search element:"<<*mid << endl;
cin.get();
return 0;
}
0 0
- C++ vector实现二分查找法
- C语言实现二分查找
- 二分查找 c语言实现
- 二分查找C语言实现
- 二分查找实现 C代码
- C语言实现二分查找
- 二分查找 C/C++实现
- c语言 实现二分查找
- c语言实现二分查找
- vector的二分查找
- 二分查找法实现
- 自写简易vector实现的二分查找
- 二分查找法的C语言实现:递归与循环
- C语言二分查找法(指针和数组实现)
- C语言二分查找法实现与细节
- 【C语言】二分查找法
- 【C语言】二分查找法
- C语言二分查找法
- volley3 网络请求的取消(http://blog.csdn.net/zrjliming/article/details/52325152)
- node.js中的setImmediate()与process.nextTick()
- Eclipse添加DTD文件实现xml的自动提示功能
- HTTP方法之GET与POST的比较
- python学习—-基本数据类型
- C++ vector实现二分查找法
- 浏览器窗口可视区域大小
- 基于Web实现在线绘画拓扑图[GraphEditor]
- mocapy
- Leetcode 21 Merge Two Sorted Lists
- RCNN学习笔记(5):faster rcnn
- Maven详解之聚合与继承
- NoHttp,volley,okhttp这三个有什么区别,哪个好用
- linux下查找某文件,文件夹的命令和方法