Illustrating the generic swap algorithm: swap two integers : swap « 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 / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » STL Algorithms Modifying sequence operations » swap

24.21.1.Illustrating the generic swap algorithm: swap two integers

#include <iostream>

#include <cassert>

#include <algorithm>

#include <vector>

using namespace std;



int main()

{

  int high = 250, low = 0;



  swap(high, low);



  cout << high << " ";

  cout << low;





  return 0;

}

0 250

24.21.swap
	24.21.1.	Illustrating the generic swap algorithm: swap two integers
	24.21.2.	Illustrating the generic swap algorithm
	24.21.3.	Swap elements at locations 0 and 1 of an array
	24.21.4.	Swap second and fourth element in a vector

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.