Using the STL generic reverse algorithm with an array : array algorithms « STL Basics « C++

1.	Bitset
2.	Class
3.	Console
4.	Data Structure
5.	Data Type
6.	Deque
7.	Development
8.	File
9.	Function
10.	Generic
11.	Language
12.	List
13.	Map Multimap
14.	Overload
15.	Pointer
16.	Qt
17.	Queue Stack
18.	Set Multiset
19.	STL Algorithms Binary search
20.	STL Algorithms Heap
21.	STL Algorithms Helper
22.	STL Algorithms Iterator
23.	STL Algorithms Merge
24.	STL Algorithms Min Max
25.	STL Algorithms Modifying sequence operations
26.	STL Algorithms Non modifying sequence operations
27.	STL Algorithms Sorting
28.	STL Basics
29.	String
30.	Valarray
31.	Vector

C / ANSI-C

C Tutorial

C++ Tutorial

Visual C++ .NET

C++ » STL Basics » array algorithms

Screenshots

Using the STL generic reverse algorithm with an array

 

 



#include <iostream>

#include <string>

#include <cassert> 

#include <algorithm> // For reverse algorithm

using namespace std;



int main()

{

  char array1[] = "abc";

  int N1 = strlen(array1);

  reverse(&array1[0], &array1[N1]);

  assert (string(array1) == "cba");

  return 0;

}

Related examples in the same category

1.	Using reverse_copy to copy the array reversely
2.	Use random_shuffle algorithms with array
3.	Illustrating the generic inner_product algorithm with predicate
4.	Illustrating the generic adjacent_difference algorithm
5.	Illustrating the generic partial_sum algorithm
6.	Use the generic partition algorithms: Partition array1, putting numbers greater than 4 first, followed by those less than or equal to 4
7.	Using function templates to get the max and min value in an array

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.