include include using namespace std; void ScrambleNums (vector remainNums, vector scramNums) { vector tmpRemainNums; int tmpRemovedNum; int i; if (remainNums.size () -- 0) { cout << scramNums.at (0); cout << scramNums.at (1); cout << scramNums.at (2) << endl; else ( for (i = 0; i< remainNums.size (); ++i) { tmpRemainNums = remainNums; // Make a copy. tmpRemovedNum = tmpRemainNums.at (i) ; tmpRemainNums.erase (tmpRemainNums.begin () + i); // Remove element at i scramNums.push_back (tmpRemovedNum) ; ScrambleNums (tmpRemainNums, scramNums); scramNums.erase (scramNums.end () - 1); // Remove last element int main () ( vector numsToScramble; vector resultNums; numsToScramble.push_back (3); numsToScramble.push_back (7); numsToScramble.push_back (8); ScrambleNums (numsToScramble, resultNums); return 0;
include include using namespace std; void ScrambleNums (vector remainNums, vector scramNums) { vector tmpRemainNums; int tmpRemovedNum; int i; if (remainNums.size () -- 0) { cout << scramNums.at (0); cout << scramNums.at (1); cout << scramNums.at (2) << endl; else ( for (i = 0; i< remainNums.size (); ++i) { tmpRemainNums = remainNums; // Make a copy. tmpRemovedNum = tmpRemainNums.at (i) ; tmpRemainNums.erase (tmpRemainNums.begin () + i); // Remove element at i scramNums.push_back (tmpRemovedNum) ; ScrambleNums (tmpRemainNums, scramNums); scramNums.erase (scramNums.end () - 1); // Remove last element int main () ( vector numsToScramble; vector resultNums; numsToScramble.push_back (3); numsToScramble.push_back (7); numsToScramble.push_back (8); ScrambleNums (numsToScramble, resultNums); return 0;
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
Related questions
Question
Can you please help me?
![Type the program's output
#include <iostream>
#include <vector>
using namespace std;
void ScrambleNums (vector<int> remainNums, vector<int> scramNums) (
vector<int> tmpRemainNums;
int tmpRemovedNum;
int i;
if (remainNums.size () == 0) {
cout << scramNums.at (0);
cout << scramNums.at (1) ;
cout << scramNums.at (2) << endl;
else (
for (i = 0; i < remainNums.size (); ++i) {
tmpRemainNums = remainNums; // Make a copy.
tmpRemovedNum = tmpRemainNums.at (i) ;
tmpRemainNums.erase (tmpRemainNums.begin () + i); // Remove element at i
scramNums.push_back (tmpRemovedNum) ;
ScrambleNums (tmpRemainNums, scramNums);
scramNums.erase (scramNums.end () - 1); // Remove last element
int main ( {
vector<int> numsToScramble;
vector<int> resultNums;
numsToScramble.push_back (3);
numsToScramble.push_back (7);
numsToScramble.push_back (8);
ScrambleNums (numsToScramble, resultNums) ;
return 0;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F6a31dd09-aa7f-43d6-a310-f5a570ee0774%2Fb413618b-2133-4af0-8cef-8dbaf3a16da3%2Fgidls3j_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Type the program's output
#include <iostream>
#include <vector>
using namespace std;
void ScrambleNums (vector<int> remainNums, vector<int> scramNums) (
vector<int> tmpRemainNums;
int tmpRemovedNum;
int i;
if (remainNums.size () == 0) {
cout << scramNums.at (0);
cout << scramNums.at (1) ;
cout << scramNums.at (2) << endl;
else (
for (i = 0; i < remainNums.size (); ++i) {
tmpRemainNums = remainNums; // Make a copy.
tmpRemovedNum = tmpRemainNums.at (i) ;
tmpRemainNums.erase (tmpRemainNums.begin () + i); // Remove element at i
scramNums.push_back (tmpRemovedNum) ;
ScrambleNums (tmpRemainNums, scramNums);
scramNums.erase (scramNums.end () - 1); // Remove last element
int main ( {
vector<int> numsToScramble;
vector<int> resultNums;
numsToScramble.push_back (3);
numsToScramble.push_back (7);
numsToScramble.push_back (8);
ScrambleNums (numsToScramble, resultNums) ;
return 0;
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education