Illustrating the generic binary search algorithms : binary_search « STL Algorithms Binary search « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » STL Algorithms Binary search » binary_search

26.1.1.Illustrating the generic binary search algorithms

#include <iostream>

#include <cassert>

#include <algorithm>

#include <vector>

using namespace std;



int main()

{

  vector<int> v(5);

  bool found;



  for (int i = 0; i < 5; ++i)

     v[i] = i;



  found = binary_search(v.begin(), v.end(), 3);

  cout << found << " ";



  // Try searching for a value that's not present:

  found = binary_search (v.begin(), v.end(), 9);

  cout << found;



  return 0;

}

1 0

26.1.binary_search
	26.1.1.	Illustrating the generic binary search algorithms
	26.1.2.	Use binary_search to locate a value in a vector
	26.1.3.	binary_search a list
	26.1.4.	Use binary_search() to binary search a vector
	26.1.5.	Binary search after sorting

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.