merge the elements of NumbersVestor and NumbersList and place the results in NumbersDeque : Algorithm « vector « 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 » vector » Algorithm

16.32.6.merge the elements of NumbersVestor and NumbersList and place the results in NumbersDeque

#include <iostream>

#include <vector>

#include <algorithm>

#include <list>

#include <deque>



using namespace std;



int main(void)

{

  const int MAX_ELEMENTS = 8;

  typedef vector<int> IntVector;    

  typedef IntVector::iterator IntVectorIt;

  typedef list<int> IntList;      

  typedef IntList::iterator IntListIt;

  typedef deque<int> IntDeque;    

  typedef IntDeque::iterator IntDequeIt;



  IntVector NumbersVector(MAX_ELEMENTS);

  IntVectorIt startv, endv, itv;

  IntList NumbersList;

  IntListIt first, last, itl;

  IntDeque NumbersDeque(2 * MAX_ELEMENTS);

  IntDequeIt itd;



  NumbersVector[0] = 4;

  NumbersVector[1] = 10;

  NumbersVector[2] = 70;

  NumbersVector[3] = 10;

  NumbersVector[4] = 30;

  NumbersVector[5] = 69;

  NumbersVector[6] = 96;

  NumbersVector[7] = 100;



  first = NumbersList.begin();  

  last = NumbersList.end();    



  //place the results in NumbersDeque

  merge(startv, endv, first, last, NumbersDeque.begin());



  for (itd = NumbersDeque.begin(); itd != NumbersDeque.end(); itd++)

    cout << *itd << " ";

}

16.32.Algorithm
	16.32.1.	Using the for_each() Algorithm
	16.32.2.	find_if, bind2nd and greater_equal
	16.32.3.	Mutating Sequence Algorithm
	16.32.4.	Use the count_if algorithm with the unary predicate IsEven
	16.32.5.	Use count to determine the number of '0's in the vector
	16.32.6.	merge the elements of NumbersVestor and NumbersList and place the results in NumbersDeque
	16.32.7.	shuffle the elements in a random order
	16.32.8.	Fill elements in a vector with custom generator
	16.32.9.	random number generation in quantitative finance
	16.32.10.	Inner product of a vector and another vector
	16.32.11.	The adjacent difference of the vector
	16.32.12.	for_each element in a vector apply custom function
	16.32.13.	Find the first element in the range (first, last + 1) that matches value

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.