In c++, Thanks!!! Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Take an array and its size as input params and return a bool such that 'true' ==> array and all elements are prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering " as the first statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving " as the last statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. You will need to define one other helper function (IsPrimeRecur) for the recursion which should also not contain any loops to make it a true recursive method. Remember - replace with the actual name of each function. Including your 'main', there will be a total of 4 functions in your program and only the primary helper functions can be invoked from 'main'. Note - for all functions except 'main', the 'Entering ' and 'Leaving statements should be printed. Hint - try to complete your iterative code first and then convert it piece by piece to the recursive code. In your main: You can expect the user will input the number of elements for the array on one line, not to exceed SORT_MAX_SIZE = 16 (validate input). Create an array based on the size input provided by the user. On the next input line you can expect the user will provide all the array elements separated by spaces. Validate that the integers input by the user are between 1 and 9999, both inclusive. Remember: 1 is not a prime number. Make a call to the primary iterative function passing the array and its size. If every member is a Prime, then the program should print out 'Prime Array using iteration', otherwise print out 'Not a Prime Array using iteration'. Then make a call to the primary recursive function passing the array and its size. If every member is a Prime, then the program should print out 'Prime Array using recursion', otherwise print out 'Not a Prime Array using recursion'. If your functions are coded correctly, both should come up with the same answer, except you should have lots more output statements using recursion. There is no sample output - you are allowed to provide user interactivity as you see fit but programs will be graded for clarity of interaction. You can use language native arrays - DO NOT USE VECTORS, COLLECTIONS, SETS, BAGS or any other data structures from your programming language. There will be only one code file in your submission. Remember to take multiple screenshots so that they are clearly readable without needing to zoom in. For documentation, include your name block as well pre/post and pseudocode for the 3 functions which are not 'main'. For pre/post documentation and pseudocode examples, see Design Tools and Documentation.pdf download Upload your code file and the screenshots in one zip file. Do not include anything else.

In c++, Thanks!!! Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Take an array and its size as input params and return a bool such that 'true' ==> array and all elements are prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering " as the first statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving " as the last statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. You will need to define one other helper function (IsPrimeRecur) for the recursion which should also not contain any loops to make it a true recursive method. Remember - replace with the actual name of each function. Including your 'main', there will be a total of 4 functions in your program and only the primary helper functions can be invoked from 'main'. Note - for all functions except 'main', the 'Entering ' and 'Leaving statements should be printed. Hint - try to complete your iterative code first and then convert it piece by piece to the recursive code. In your main: You can expect the user will input the number of elements for the array on one line, not to exceed SORT_MAX_SIZE = 16 (validate input). Create an array based on the size input provided by the user. On the next input line you can expect the user will provide all the array elements separated by spaces. Validate that the integers input by the user are between 1 and 9999, both inclusive. Remember: 1 is not a prime number. Make a call to the primary iterative function passing the array and its size. If every member is a Prime, then the program should print out 'Prime Array using iteration', otherwise print out 'Not a Prime Array using iteration'. Then make a call to the primary recursive function passing the array and its size. If every member is a Prime, then the program should print out 'Prime Array using recursion', otherwise print out 'Not a Prime Array using recursion'. If your functions are coded correctly, both should come up with the same answer, except you should have lots more output statements using recursion. There is no sample output - you are allowed to provide user interactivity as you see fit but programs will be graded for clarity of interaction. You can use language native arrays - DO NOT USE VECTORS, COLLECTIONS, SETS, BAGS or any other data structures from your programming language. There will be only one code file in your submission. Remember to take multiple screenshots so that they are clearly readable without needing to zoom in. For documentation, include your name block as well pre/post and pseudocode for the 3 functions which are not 'main'. For pre/post documentation and pseudocode examples, see Design Tools and Documentation.pdf download Upload your code file and the screenshots in one zip file. Do not include anything else.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Related questions

Concept explainers

Question

In c++, Thanks!!!

Write the simplest program that will demonstrate iteration vs recursion using the following guidelines -

Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which
1. Take an array and its size as input params and return a bool such that
  - 'true' ==> array and all elements are prime,
  - 'false' ==> at least one element in array is not prime, so array is not prime.
2. Print out a message "Entering <function_name>" as the first statement of each function.
3. Perform the code to test whether every element of the array is a Prime number.
4. Print out a message "Leaving <function_name>" as the last statement before returning from the function.
5. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. You will need to define one other helper function (IsPrimeRecur) for the recursion which should also not contain any loops to make it a true recursive method.
6. Remember - replace <function_name> with the actual name of each function.
7. Including your 'main', there will be a total of 4 functions in your program and only the primary helper functions can be invoked from 'main'. Note - for all functions except 'main', the 'Entering <function name>' and 'Leaving <function name'> statements should be printed.
8. Hint - try to complete your iterative code first and then convert it piece by piece to the recursive code.
In your main:
1. You can expect the user will input the number of elements for the array on one line, not to exceed SORT_MAX_SIZE = 16 (validate input).
2. Create an array based on the size input provided by the user.
3. On the next input line you can expect the user will provide all the array elements separated by spaces. Validate that the integers input by the user are between 1 and 9999, both inclusive. Remember: 1 is not a prime number.
4. Make a call to the primary iterative function passing the array and its size.
5. If every member is a Prime, then the program should print out 'Prime Array using iteration', otherwise print out 'Not a Prime Array using iteration'.
6. Then make a call to the primary recursive function passing the array and its size.
7. If every member is a Prime, then the program should print out 'Prime Array using recursion', otherwise print out 'Not a Prime Array using recursion'.
8. If your functions are coded correctly, both should come up with the same answer, except you should have lots more output statements using recursion.
9. There is no sample output - you are allowed to provide user interactivity as you see fit but programs will be graded for clarity of interaction.
You can use language native arrays - DO NOT USE VECTORS, COLLECTIONS, SETS, BAGS or any other data structures from your programming language.
There will be only one code file in your submission.
Remember to take multiple screenshots so that they are clearly readable without needing to zoom in.
For documentation, include your name block as well pre/post and pseudocode for the 3 functions which are not 'main'. For pre/post documentation and pseudocode examples, see Design Tools and Documentation.pdf download
Upload your code file and the screenshots in one zip file. Do not include anything else.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 3 images

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.