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 Helper 45 codes
Home
C++ Tutorial
STL Algorithms Helper
1 Adjacent_difference
2 Algorithm
3 All permutations of ABC by use of next_permutation()
4 All permutations of ABC by use of prev_permutation()
5 Calculate sum of elements in a vector
6 Demonstrate bind2nd()
7 Demonstrate gslice()
8 Demonstrating the generic accumulate algorithm with a reverse iterator
9 Distance
10 Get the distance between two element in a list
11 Illustrating the generic accumulate algorithm with predicate
12 Illustrating the generic next_permutation algorithms
13 Illustrating the generic prev_permutation algorithms
14 Negate
15 Negators with find_if, not1, greater_equals
16 Next_permutation() and prev_permutation()
17 Replace_if bind2nd and greater
18 Replace_if, bind2nd and less
19 Slice a valarray
20 The total of the elements in a vector
21 Trasform, bind2nd and plus
22 Use a binary function object divides
23 Use adjacent_difference to convert elements in a container into relative values
24 Use back_insert_iterator to insert element into a vector
25 Use bind2nd() to create a unary function object that will return true when a value is greater than 10
26 Use inner_product to calculate inner reverse product
27 Use inner_product to process sum of all products(0 + 11 + 22 + 33 + 44 + 55 + 66)
28 Use inner_product with inner and outer operation
29 Use make_pair to insert pair value to a map
30 Use next_permutation to permute elements until they are sorted
31 Use not1() to reverse sort v
32 Use not2() to remove all characters that are not equal to H
33 Use numeric_limits to get max value for float, double and long double
34 Use numeric_limits to get max value for short, int and long
35 Use partial_sum to convert elements in a container into absolute values
36 Use partial_sum to print all partial products
37 Use partial_sum to print all partial sums
38 Use prev_permutation to permute elements until they are sorted in descending order
39 Use prev_permutation to permute until descending sorted
40 Use the generic count algorithm with predicate
41 Use unique_copy to copy elements in an array to list with back_inserter
42 Using the generic accumulate algorithm to compute a product by using a function object
43 Using the generic accumulate algorithm to compute a product by using multiplies
44 Whether char is signed
45 Whether numeric limits for type string exist