CODE USING C++ 2. I'm Lost, Help! by CodeChum Admin Thanks for your help previously, Programmer. I'm now on my to the enemy's base but it seems that I'm lost. I've been going on for quite some time now and it seems that things are always the same. Can you help me fix this map I am holding? Instructions: In the code editor, you are provided with an initial main() code and an initial walk() recursive function. The walk() recursive function is basically printing the values from 1 to 1000. However, currently, the walk() function is broken - it's always printing 1. It seems that there's something wrong with its recursive case. Try to fix it so Agent J. will find his way to the enemy's base. Output 1 2 3 4 5 6 7 8 9 10 .

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

CODE USING C++

2. I'm Lost, Help!

by CodeChum Admin

Thanks for your help previously, Programmer.

 

I'm now on my to the enemy's base but it seems that I'm lost. I've been going on for quite some time now and it seems that things are always the same.

 

Can you help me fix this map I am holding?

 

 

Instructions:

  1. In the code editor, you are provided with an initial main() code and an initial walk() recursive function.
  2. The walk() recursive function is basically printing the values from 1 to 1000.
  3. However, currently, the walk() function is broken - it's always printing 1. It seems that there's something wrong with its recursive case. Try to fix it so Agent J. will find his way to the enemy's base.

Output

1
2
3
4
5
6
7
8
9
10
.
.
.
 
main.cpp
< > + C++
Tests
1 #include <iostream>
2 using namespace std;
CE Run Tests
4 void walk(int);
5
Constraints
6 int main(void) {
7
8
walk (1);
O Constraint 1
9
The code should call 'walk' in main.
10
11 }
12
13 void walk(int n) {
14
return 0;
O Constraint 2
if(n <= 1000) {
cout << n << endl;
The 'walk' function should apply recursion.
15
16
17
18
19
// TODO: Fix this
walk(n);
}
Test Cases
20
O Test Case 1 Hidden
O Launch me
Transcribed Image Text:main.cpp < > + C++ Tests 1 #include <iostream> 2 using namespace std; CE Run Tests 4 void walk(int); 5 Constraints 6 int main(void) { 7 8 walk (1); O Constraint 1 9 The code should call 'walk' in main. 10 11 } 12 13 void walk(int n) { 14 return 0; O Constraint 2 if(n <= 1000) { cout << n << endl; The 'walk' function should apply recursion. 15 16 17 18 19 // TODO: Fix this walk(n); } Test Cases 20 O Test Case 1 Hidden O Launch me
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY