Create permutations based on vector

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
  vector<char> vectorObject;
  int i;

  for(i = 0; i < 3; i++) 
     vectorObject.push_back('A'+i);

  cout << "All permutations of 3 characters:\n";

  do {
    for(i = 0; i < vectorObject.size(); i++)
      cout << vectorObject[ i ];
      
    cout << endl;
  } while(next_permutation(vectorObject.begin(), vectorObject.end()));

  return 0;
}

Related examples in the same category

1.	Perform an in-place merge for two vectors
2.	Using Other Search functions
3.	Matching Elements Using the equals and mismatch Operations
4.	Creating and Resizing Vectors
5.	Demonstrate count and count_if.
6.	Demonstrate remove_copy in Vector
7.	Access a vector using an iterator.
8.	Demonstrate insert and erase.
9.	Store a class object in a vector.
10.	Demonstrate allocator's max_size() fucntion in vector
11.	Demonstrate count() in vector
12.	Demonstrate count_if().
13.	Demonstrate reverse in vector
14.	Demonstrate insert_iterator in vector
15.	Demonstrate adjacent_difference() in vector
16.	Demonstrate inner_product() in vector
17.	Demonstrate partial_sum() in Vector
18.	Storing Class Objects with overloaded operators in a Vector
19.	Vector Init Array
20.	Use istream_iterator with the copy algorithm
21.	Demonstrate remove_copy and replace_copy.
22.	Vector: Insert Erase Sort
23.	Demonstrate accumulate() in vector
24.	end() in vector
25.	Use pop_back() and empty().
26.	Access the elements of a vector through an iterator.
27.	The basic operation of a vector: size, push_back,
28.	Accessing a Vector Through an Iterator
29.	Use istream_iterator to read various data types
30.	Work with heaps: make_heap from vector
31.	Demonstrating the four ways that vectors can be created.
32.	Vector Capacity vs size
33.	Using clear()

Create permutations based on vector : Vector « Data Structure « C++

Related examples in the same category