
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
use C
Implement this in a program. Write two functions, one for solving it iteratively, one for solving it recursively.
Take two arguments from the command-line: an "i" or "r", and the term number (how many terms to print).
Print out which method executed (was selected) and all the terms (and the number of terms)
Expert Solution

arrow_forward
Overview
In this question we have to provide the C program for Recaman's Sequence
Let's code, hope this helps if you have queries on the solution, you may utilize the threaded question feature.
Trending nowThis is a popular solution!
Step by stepSolved in 3 steps with 4 images

Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question
why output is Usage: ./main <i|r> <term number>
exit status 1?
![C main.c x +
C main.c> f main
1 #include <stdio.h>
2 #include <stdlib.h>
3 #include <stdbool.h>
4
5 #define MAX_TERMS 55000
6
7
8
9
10 // Iterative function to generate Recaman's Sequence
11 ✓ void iterative_recaman(int n) {
12
13
14
15
16
17
18
99
int seq[MAX_TERMS];
bool used [MAX_TERMS];
V
int i;
seq[0] = 0;
used [0] = true;
}
for (i =
}
1; i < n; i++) {
seq[i]
seq[i-1] i;
if (seq[i]<0 || used[seq[i]]) {
seq[i] = seq[i - 1] + i;
19
20
21
22
23
24
25 // Recursive function to generate Recaman's Sequence
26
int recursive_recaman (int n) {
27
int i = seq[n - 1] - n;
Line 77: Col 2
}
=
used[seq[i]] = true;
14
History
> Console x
> make -s
> ./main
Shell x
+
Usage: ./main <i[r> <term number>
exit status 1
>
o
EP](https://content.bartleby.com/qna-images/question/5b1907b1-a684-4a7a-a6d2-eae182fd8cd2/3a005f79-e281-4e72-a048-6103074e8b9b/vylqalg_thumbnail.png)
Transcribed Image Text:C main.c x +
C main.c> f main
1 #include <stdio.h>
2 #include <stdlib.h>
3 #include <stdbool.h>
4
5 #define MAX_TERMS 55000
6
7
8
9
10 // Iterative function to generate Recaman's Sequence
11 ✓ void iterative_recaman(int n) {
12
13
14
15
16
17
18
99
int seq[MAX_TERMS];
bool used [MAX_TERMS];
V
int i;
seq[0] = 0;
used [0] = true;
}
for (i =
}
1; i < n; i++) {
seq[i]
seq[i-1] i;
if (seq[i]<0 || used[seq[i]]) {
seq[i] = seq[i - 1] + i;
19
20
21
22
23
24
25 // Recursive function to generate Recaman's Sequence
26
int recursive_recaman (int n) {
27
int i = seq[n - 1] - n;
Line 77: Col 2
}
=
used[seq[i]] = true;
14
History
> Console x
> make -s
> ./main
Shell x
+
Usage: ./main <i[r> <term number>
exit status 1
>
o
EP
Solution
by Bartleby Expert
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question
why output is Usage: ./main <i|r> <term number>
exit status 1?
![C main.c x +
C main.c> f main
1 #include <stdio.h>
2 #include <stdlib.h>
3 #include <stdbool.h>
4
5 #define MAX_TERMS 55000
6
7
8
9
10 // Iterative function to generate Recaman's Sequence
11 ✓ void iterative_recaman(int n) {
12
13
14
15
16
17
18
99
int seq[MAX_TERMS];
bool used [MAX_TERMS];
V
int i;
seq[0] = 0;
used [0] = true;
}
for (i =
}
1; i < n; i++) {
seq[i]
seq[i-1] i;
if (seq[i]<0 || used[seq[i]]) {
seq[i] = seq[i - 1] + i;
19
20
21
22
23
24
25 // Recursive function to generate Recaman's Sequence
26
int recursive_recaman (int n) {
27
int i = seq[n - 1] - n;
Line 77: Col 2
}
=
used[seq[i]] = true;
14
History
> Console x
> make -s
> ./main
Shell x
+
Usage: ./main <i[r> <term number>
exit status 1
>
o
EP](https://content.bartleby.com/qna-images/question/5b1907b1-a684-4a7a-a6d2-eae182fd8cd2/3a005f79-e281-4e72-a048-6103074e8b9b/vylqalg_thumbnail.png)
Transcribed Image Text:C main.c x +
C main.c> f main
1 #include <stdio.h>
2 #include <stdlib.h>
3 #include <stdbool.h>
4
5 #define MAX_TERMS 55000
6
7
8
9
10 // Iterative function to generate Recaman's Sequence
11 ✓ void iterative_recaman(int n) {
12
13
14
15
16
17
18
99
int seq[MAX_TERMS];
bool used [MAX_TERMS];
V
int i;
seq[0] = 0;
used [0] = true;
}
for (i =
}
1; i < n; i++) {
seq[i]
seq[i-1] i;
if (seq[i]<0 || used[seq[i]]) {
seq[i] = seq[i - 1] + i;
19
20
21
22
23
24
25 // Recursive function to generate Recaman's Sequence
26
int recursive_recaman (int n) {
27
int i = seq[n - 1] - n;
Line 77: Col 2
}
=
used[seq[i]] = true;
14
History
> Console x
> make -s
> ./main
Shell x
+
Usage: ./main <i[r> <term number>
exit status 1
>
o
EP
Solution
by Bartleby Expert
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.Similar questions
- Write a recursive function that displays the number of even and odd digits in an integer using the following header: void evenAndOddCount(int value) Write a test program that prompts the user to enter an integer and displays the number of even and odd digits in it.arrow_forwardRecursive Power MethodWrite a method called powCal that uses recursion to raise a number to a power. The method should accept two arguments: The first argument is the exponent and the second argument is the number to be raised (example” powCal(10,2) means 210). Assume that the exponent is a nonnegative integer. Demonstrate the method in a program called Recursive (This means that you need to write a program that has at least two methods: main and powCal. The powCal method is where you implement the requirements above and the main method is where you make a method call to demonstrate how your powCal method work).arrow_forwardPlease complete this program in C++ Please enusre that there is plenty of comments. PLENTY even if unessessary. Please include screenshots of actual code, screenshots of output, and code in the browser so I can copy and paste. Thank you.arrow_forward
- C Programming Language Note: Input and Output Must be the same Write in C Languagearrow_forwardPython only** define the following function: 1. This function must add a task to a checklist, setting its initial value to False. It will accept two parameters: the checklist object to add to, and the task name to add. In addition to adding the task, it must return the (now modified) checklist object that it was given. There is one issue, however: a task cannot be added to a checklist if the name requested is already being used by another task in that checklist. In that case, this function must print a specific message and must return None Define addTask with 2 parameters Use def to define addTask with 2 parameters Use a return statement Within the definition of addTask with 2 parameters, use return _ in at least one place. Do not use any kind of loop Within the definition of addTask with 2 parameters, do not use any kind of loop.arrow_forwardAlert: Don't submit AI generated answer and please submit a step by step solution and detail explanation for each steps. Write a python program using functionsarrow_forward
- python only define the following function: This function must reset the value of every task in a checklist to False. It accept just one parameter: the checklist object to reset, and it must return the (now modified) checklist object that it was given. Define resetChecklist with 1 parameter Use def to define resetChecklist with 1 parameter Use a return statement Within the definition of resetChecklist with 1 parameter, use return _in at least one place. Use any kind of loop Within the definition of resetChecklist with 1 parameter, use any kind of loop in at least one place.arrow_forwardName:- Mit (Question-1) Note:- Please type this java code and also need an output for this given Java program.arrow_forwardc programming Task 3: Complete armstrong_task3.c by implementing armstrong_recursive function. int armstrong_recursive (int arm); It performs same operation as in Task 1, however in a recursive manner. A number to be checked whether it is armstrong or not is given as an input and the function returns the summation of the digits. If the returned value is equal to the given input value then it is an armstrong number.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

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)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON

Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education