Use back_insert_iterator to insert element into a vector : random_shuffle « 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 » random_shuffle

24.7.2.Use back_insert_iterator to insert element into a vector

#include <iostream>

#include <vector>

#include <algorithm>

#include <iterator>



using namespace std;



int main( ) {



   vector<int> v;

   back_insert_iterator<std::vector<int> > p = back_inserter(v);



   for (int i = 0; i < 10; ++i)

     *p = i;



   for (int i = 0; i < 10; ++i){

       cout << v[i];

   }



   cout << "\n\n\n";

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



   for (int i = 0; i < 10; ++i){

       cout << v[i];

   }



}

24.7.random_shuffle
	24.7.1.	std::random_shuffle a vector
	24.7.2.	Use back_insert_iterator to insert element into a vector
	24.7.3.	Use random_shuffle to shuffle all elements randomly
	24.7.4.	Use random_shuffle to shuffle elements with self-written random number generator
	24.7.5.	Shuffle a sequence with random_shuffle()
	24.7.6.	shuffle the container with random_shuffle
	24.7.7.	Number of elements greater than 9: count_if and greater()

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.