Question

Assignment 6: Recursion
Learning Outcomes
• Learn how to craft solutions using recursion instead of loops.
Instructions
This assignment will be different than previous assignments (and most assignments which come after it). In this assignment, you will be crafting four solutions to four different problems.
This assignment will also have special requirements regarding how you may code. You are not allowed to use assignment statements. This includes using preincement, postincrement, predecrement, and postdecrement. You are allowed to use assignment to initialize variables and this is the only exception. Thus,
int x = 2; // This is allowed.
x = 3; // This is not allowed.
x += 1; // This is not allowed.
x--; // This is not allowed.
You are also not allowed to use any loop construct. Thus any use of for, while, and do..while is not allowed. Any C++ trickery which modifies a previously declared variable is also not allowed (such as, but not limited to, the use of pointers to modify variables). Once declared, a variable is never allowed to be changed.
Problem 1: Double or Nothing
Suppose we have a list of integers. Write a function which returns true if the array contains somewhere a value and the next value is doubled. The value could exist anywhere in the list and there could be multiple instances. You need to detect if there is at least one instance of this circumstance. At a minimum, the list will contain one integer.
bool doubleOrNothing(int* array, int size);
Testing
Test your program with the following:
• ([1], 1): false
• ([1,2], 2): true
• ([0,0,1], 3): true
• ([2,3,4], 3): false
• ([1,3,5,10], 4): true
• ([1,3,5,11], 4): false
• ([9,8,7,6,5,4,3,2,1], 9): false
• ([9,8,7,6,12,4,3,2,1], 9): true
Problem 2: Word Separator
Given two strings, word and a separator sep, return a big string made of count occurrences of the word, separated by the separator string. If the count is 0, return an empty string. If the count is 1, return word.
std::string wordSeparator(std::string word, std::string sep, int count);
Testing
• (“Y”, “X”, 3): “YXYXY”
• (“Y”, “X”, 2): “YXY”
• (“Y”, “X”, 1): “Y”
• (“Y”, “X”, 0): ""
Problem 3: McNugget Numbers
A McNugget Number is a number of Chicken McNuggets which can be purchased at McDonalds. The mathematical definition of a McNugget number changes over the years with changes to the menu. When I was researching this problem, I realized that this is too trivial to write, so we are going to invent our own definition of a McNugget number.
In a fictional McDonald’s somewhere in the Universe, you can purchase the following orders of McNuggets:
• 3 piece
• 7 piece
Your task is to write a recursive function which will report of a number is a McNugget number.
bool mcNuggetNumber(int n);
Testing
• These numbers are McNugget numbers: 3, 6, 7, 9, 10, 12
• These are not: 0, 1, 2, 4, 5, 8, 11
Problem 4: Can the array be split?
Given an array of integers, can you evenly divide the list into two arrays, each with a sum equal to half of the original? You don’t have return the two smaller arrays. You need to return true if it can be done and false otherwise.
• 5 2 3 can be divided evenly because we can put 5 in one list and 2 and 3 in the other list. Both lists are half of the sum of the original.
That’s pretty much it. Here are some tips:
• Write a method to compute the sum of the list.
• Make sure that your sum algorithm supports a 0-length array.
• If the sum of the list is odd, return false. There’s no point in doing the rest.
• Write a method that will attempt to iterate through the array, selecting or not selecting each element, each time contributing to a total.
– Once the total equals the desired amount, return true.
– If there are too many values selected, return false.
Sample Output
There is no input on this assignment. Your code will be studied for accuracy. Your output should match mine. (Obviously, don’t copy my output. You don’t learn that way.)
Assignment 5. Recursion.
All calls must result in a 1 in order to pass the problem.

Double Or Nothing.
1. 1
2. 1
3. 1
4. 1
5. 1
6. 1
7. 1
8. 1

Word Separator.
1. 1
2. 1
3. 1
4. 1

McNugget Numbers
1. 1
2. 1
3. 1
4. 1
5. 1
6. 1
7. 1
8. 1
9. 1
10. 1
11. 1
12. 1
13. 1
14. 1
15. 1
Split the rray 1. 1 2. 1 3. 1 4. 1 5. 1 6. 1 7. 1 8. 1 9. 1 10. 1 11. 1 12. 1 13. 1
What to Hand In
Upload a zip file containing the following files to the drop box on D2L:
• Your driver with FirstNameLastNameA6.cpp
• Your solutions header file: solutions.h
• Your solutions implementation file: solutions.cpp
• Make sure your name, CSCI 3250, and Programming Assignment 6 appear in comments in all of your files.
• Note: NO CREDIT will be given to programming assignments that do not compile.
• Make sure you have compiled and tested your program before handing it in.

m nuggets please in c++

i would like mcnuggets program in c++

Answer 1

bool doubleOrNothing(int* array, int size) {
    int i = 0;
    while(i < size-1) {
        if(array[i] == array[i+1]) {
            return true;
        }
        i++;
    }
    return false;
}

**************************************************

Answering your first question, as the questions are completely unrelated and require different code. I request you to please post single question in a thread, so that it helps us in explaining the things better to you. Hope you understand!

Thanks for your question. We try our best to help you with detailed answers, But in any case, if you need any modification or have a query/issue with respect to above answer, Please ask that in the comment section. We will surely try to address your query ASAP and resolve the issue.

Please consider providing a thumbs up to this question if it helps you. by Doing that, You will help other students, who are facing similar issue.