Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

bartleby

Concept explainers

Question

use C Program Online compilation Recamán's Sequence

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
Check Mark
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.

Still need help?
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
expand button
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
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
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
expand button
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
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Knowledge Booster
Background pattern image
Computer Science
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
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education