Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Write a C++ function is_perm which determines if a given array of n integers is a permutation of {0..n-1}. Write a function which takes a
- Write a C++ function is_perm which determines if a given array of n integers is a permutation of {0..n-1}.
- Write a function which takes a permutation as an array of n integers and constructs its inverse (also as an array). Your function will allocate storage for the inverse array and returns it as an integer pointer. If the array it receives is not a permutation of {0..n-1}, it returns nullptr instead.
Templates given below.
bool is_perm(int a[], int n) {
} |
int * perm2inverse(int a[], int n) {
if(!is_perm(a, n)) // to get you started... return nullptr;
// otherwise, a[] is a permutation of 0..n-1; allocate and populate its // inverse array (and return it)
} |
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started