Answered: I have the following code for finding…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

I have the following code for finding the next permutation:

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

int main()
{
int max = 3;
int arr[max] = { 1, 2, 3};

do {
cout << arr[0] << " " << arr[1] << " " << arr[2] << " " << arr[0] << "\n";
} while (next_permutation(arr + 1, arr + max));

cout << "After loop: " << arr[0] << ' '
<< arr[1] << ' ' << arr[2] << '\n';

return 0;
}

It gives me the following output:

1 2 3 1
1 3 2 1
After loop: 1 2 3

Now, I am wondering why the permutation would stop at 1321 and why would it order it in such a way.

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions