Question
I'm having trouble printing a fibonacci sequence using pointers with malloc to get this output. now...
I'm having trouble printing a fibonacci sequence using pointers with malloc to get this output.
now printing with pointers:
0 1 1 2 3 5 8 13 21 34 55 89
Here's my code:
#include <stdio.h>
#include <stdlib.h>
void fib1(int a[]);
void fib2(int* a);
int main() {
int arr[2] = {0,1};
int *pointer;
arr[0]=0;
arr[1]=1;
fib1(arr);
fib2(pointer);
return 0;
}
void fib1(int a[]){
printf("printing with arrays:\n");
for(int i=0; i<6; i++){
printf("%d %d ", a[0],a[1]);
a[0] = a[0] + a[1];
a[1] = a[0] + a[1];
}
printf("\n\n");
}
void fib2(int * a){
printf("printing with pointers:\n");
for(int i=0; i<6; i++){
printf("%d %d ", *(a+0),*(a+1));
a[0] = a[0] + a[1];
a[1] = a[0] + a[1];
}
printf("\n\n");
}
Homework Answers
Answer #1
#include <stdio.h>
#include <stdlib.h>
void fib1(int a[]);
void fib2(int* a);
int main() {
int arr[2] = {0,1};
int *pointer;
arr[0]=0;
arr[1]=1;
fib1(arr);
//creating the malloc with size 2
pointer=(int *)malloc(2*sizeof(int));
// adding 1st value as 0 and second value as 1
pointer[0]=0;
pointer[1]=1;
fib2(pointer);
return 0;
}
void fib1(int a[]){
printf("printing with arrays:\n");
for(int i=0; i<6; i++){
printf("%d %d ", a[0],a[1]);
a[0] = a[0] + a[1];
a[1] = a[0] + a[1];
}
printf("\n\n");
}
void fib2(int * a){
printf("printing with pointers:\n");
for(int i=0; i<6; i++){
printf("%d %d ", *(a+0),*(a+1));
a[0] = a[0] + a[1];
a[1] = a[0] + a[1];
}
printf("\n\n");
}
Not the answer you're looking for?
Similar Questions
Using the following code answer the next couple questions: #include<stdio.h> #include<stdlib.h> #include<string.h> /* Rewrite using a...
Using the following code answer the next couple questions:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
/* Rewrite using a pointer to char str[] */
void array_to_ptr () {
int n=0, len;
char str[ ] = "Hello World!";
len = strlen(str);
for( n=0; n<len; n++) {
putc(str[n], stdout);
}
printf("\nlength = %d\n", n);
}
int contains (char * str, char c);
int * makearray(int n);
int main (void) {
printf("Question #2 - array_to_ptr:\n");
array_to_ptr();
printf("\n------------------------------------\n\n");
printf("Question #3 - contains:\n");
printf("Test #1: ");
if...
For each part labeled P(n), there is a warning/error/problem that goes with it. Write down what...
For each part labeled P(n), there is a warning/error/problem that goes with it. Write down what the issue was in the `Error:` section of each problem. And fix the code to make it work.
// P0
#include <stdio.h>
#include <stdlib.h>
/* Error:
*/
void fib(int* A, int n);
int
main(int argc, char *argv[]) {
int buf[10];
unsigned int i;
char *str;
char *printThisOne;
char *word;
int *integers;
int foo;
int *bar;
char *someText;
// P1
for (i = 0; i...
What is output? #include <stdio.h> void CheckValue(int* pointVar1, int* pointVar2) { if (pointVar1 == NULL...
What is output?
#include <stdio.h>
void CheckValue(int* pointVar1, int* pointVar2)
{
if (pointVar1 == NULL && pointVar2 == NULL)
{
printf("Pointer is
null\n");
}
else if (*pointVar2 > *pointVar1) {
printf("%p\n",
*pointVar2);
}
else if (*pointVar1 > *pointVar2) {
printf("%p\n",
*pointVar1);
}
}
int main() {
int num1 = 5;
int num2 = 9;
CheckValue(&num1,
&num2);
return 0;
}
a.
0
b.
5
c.
9
d.
Pointer is null
e....
In assembler code must be a gcd.s file So here is the C code I have...
In assembler code must be a gcd.s file
So here is the C code I have written originally for the program.
My question is how do I convert it to assembly code?
//C code
#include <stdio.h>
int fibonacci(int n) {
if(n <= 2) {
return 1;
} else {
return fibonacci(n-1) + fibonacci(n-2);
}
}
int main(void) {
int n;
printf("Enter Fibonacci term: ");
scanf("%d", &n);
printf("The %dth Fibonacci number is %d\n", n, fibonacci(n));
return 0;
}
Instructions
In C...
Q3) Write a function that takes two arrays and their size as inputs, and calculates their...
Q3) Write a function that takes two arrays and their size as
inputs, and calculates their inner product (note that both arrays
must have the same size so only one argument is needed to specify
their size). The inner product of two arrays A and B with N
elements is a scalar value c defined as follows:
N−1
c=A·B= A(i)B(i)=A(0)B(0)+A(1)B(1)+···+A(N−1)B(N−1),
i=0
where A(i) and B(i) are the ith elements of arrays A and B,
respectively. For example, theinnerproductofA=(1,2)andB=(3,3)isc1
=9;andtheinnerproductofC= (2,5,4,−2,1)...
Expand the code below to display both the value of the loop variable and this value...
Expand the code below to display both the value of the loop
variable and this value squared. Put the pairs of values on a new
line.
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
int i;
int a;
int b;
do
{
printf("Please enter the lower value: ");
scanf("%d", &a);
printf("Please enter the upper value: ");
scanf("%d", &b);
if (a>b)
printf("The upper value must be greater than the lower
value\n\n");
}
while (a>b);
for(i=a; i<=b; i++)
printf("%d ", i);
return 0;...
Error compiler. need fix code for febonacci Iterative like 0 1 1 2 3 5 8...
Error compiler. need fix code for febonacci Iterative like 0 1 1
2 3 5 8 13 21 34 55 ....... and also need add code complexity time
if you want!
here code.c
---------------------------------------------------------------------------------------------------------------------
#include <stdio.h>
#include <math.h>
int fibonacciIterative( int n )
{
int fib[ n + 1 ];
int i;
fib[ 0 ] = 0;
fib[ 1 ] = 1;
for ( i = 2; i < n; i++ )
{
fib[ i ] = fib[ i -...
What is wrong with my recursive Binary Search code? For some reason my 'middle' value is...
What is wrong with my recursive Binary Search code? For some
reason my 'middle' value is always zero? Please fix and
explain!
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
int BinarySearch(const int A[],const int L,const int R,const int
key)
{
if (R >= 1){
int middle = L + (R-1)/2;
if (A[middle] == key)
return A[middle];
if (A[middle] > key){...
1 #include <stdio.h> 2 #include <stdlib.h> 3 4 extern char **environ; 5 void output(char *a[], char...
1 #include <stdio.h>
2 #include <stdlib.h>
3
4 extern char **environ;
5 void output(char *a[], char *b[]) {
6 int c = atoi(a[0]);
7 for (int i = 0; i < c && b[i]; ++i)
{
8 printf("%s", b[i]+2);
9 }
10 }
11
12 void main(int argc, char *argv[]) {
13
14 switch (argc) {
15 case 1:
16 for (int i = 0; environ[i]; ++i)
{
17 printf("%s\n", environ[i]);
18 }
19 break;
20 default:
21 output(argv +...
IN C PROGRAMMING A Tv_show structure keeps track of a tv show’s name and the channels...
IN C PROGRAMMING
A Tv_show structure keeps track of a tv show’s name and the
channels (integer values) that broadcast the
show. For this problem you can ONLY use the following string
library functions: strcpy, strlen, strcmp. You
MAY not use memcpy, memset, memmove. You can assume memory
allocations are successful (you do not
need to check values returned by malloc nor calloc).
typedef struct tv_show {
char *name;
int num_channels, *channels;
} Tv_show;
a. Implement the init_tv_show function that...
ADVERTISEMENT
Need Online Homework Help?
Get Answers For Free
Most questions answered within 1 hours.
ADVERTISEMENT
Active Questions
asked 4 minutes ago
asked 16 minutes ago
asked 31 minutes ago
asked 34 minutes ago
asked 47 minutes ago
asked 51 minutes ago
asked 56 minutes ago
asked 1 hour ago
asked 1 hour ago
asked 1 hour ago
asked 1 hour ago
asked 1 hour ago