#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; }
14.1.array algorithms | ||||
14.1.1. | Using the STL generic reverse algorithm with an array | |||
14.1.2. | Using reverse_copy to copy the array reversely | |||
14.1.3. | Use random_shuffle algorithms with array | |||
14.1.4. | Illustrating the generic inner_product algorithm with predicate | |||
14.1.5. | Illustrating the generic adjacent_difference algorithm | |||
14.1.6. | Illustrating the generic partial_sum algorithm | |||
14.1.7. | Use the generic partition algorithms: Partition array1, putting numbers greater than 4 first, followed by those less than or equal to 4 | |||
14.1.8. | Using function templates to get the max and min value in an array |