Mega Code Archive
Search
.Net
ASP .Net
ASP .Net Tutorial
C#
C# Book
C# by API
C# Tutorial
VB.Net
VB.Net by API
VB.Net Tutorial
Visual C++ .Net
VisualBasic Script
Java
Java
Java Book
Java by API
Java Tutorial
Script
Flash ActionScript
Flex
JavaScript DHTML
JavaScript Reference
JavaScript Tutorial
Database
MSSQL
MSSQL Tutorial
MySQL
MySQL Tutorial
Oracle PLSQL
Oracle PLSQL Tutorial
PostgreSQL
Languages
Android
C
C Tutorial
C++
C++ Tutorial
Delphi
Perl
PHP
Python
Python Tutorial
Ruby
Silverlight
Office
MSOfficeExcel 2007 Tutorial
MSOfficePowerPoint 2007 Tutorial
MSOfficeWord 2007 Tutorial
Data
XML
XML Tutorial
C++ Tutorial
STL Algorithms Binary Search 18 codes
Home
C++ Tutorial
STL Algorithms Binary Search
1 Binary search after sorting
2 Binary_search a list
3 Equal_range and distance
4 Equal_range( v begin(), v end(), 6 )
5 Illustrating the generic binary search algorithms
6 Lower bound of 6
7 Lower_bound and upper_bound
8 Return an iterator from std
9 Return iterator from std
10 Upper bound of 6
11 Use binary_search to locate a value in a vector
12 Use binary_search() to binary search a vector
13 Use equal function to check for corresponding even and odd elements
14 Use equal function to check whether both collections are equal
15 Use equal_range to determine both the lower- and upper-bound insertion points
16 Use equal_range to locate the first and last point at which 5 can be inserted in order
17 Use lower_bound to locate the first point at which 5 can be inserted in order
18 Use upper_bound to locate the last point