Reverse a stack of integers : reverse « STL Algorithms Modifying sequence operations « 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++ Tutorial » STL Algorithms Modifying sequence operations » reverse

#include <iostream>

#include <vector>

#include <algorithm>

using namespace std;

   

int main()

{

  vector<int> v;

  unsigned int i;

   

  for(i=0; i<10; i++) v.push_back(i);

   

  cout << "Initial: ";

  for(i=0; i<v.size(); i++) 

     cout << v[i] << endl;

   

  reverse(v.begin(), v.end());

   

  for(i=0; i<v.size(); i++) 

    cout << v[i] << endl;

   

  return 0;

}

24.16.reverse
	24.16.1.	Use reverse to reverse the order of elements
	24.16.2.	Use reverse to reverse order from second to last element but one
	24.16.3.	Using the STL generic reverse algorithm with a vector
	24.16.4.	Reverse the order of the found element with value 3 and all following elements
	24.16.5.	Reverse a stack of integers

java2s.com | Contact Us | Privacy Policy

All other trademarks are property of their respective owners.