but not working properly

no error but stop runing in between

At which point?

I runned it and its workin

#include<stdio.h> #include<string.h> #include<stdlib.h> struct mobile { char brand[27]; int quantity; int price; }; int count=0; void storing(struct mobile *ptr) { fflush(stdin); printf("\n\nEnter the details of %d mobile \n",count+1); printf("Brand name :"); gets(ptr[count]->brand) ; printf("Quantity :"); scanf("%d", &ptr[count]->quantity) ; printf("Price : "); scanf("%d", &ptr[count]->price) ; count++; } void search(struct mobile a[],int n) { fflush(stdin); int key; char find[27]; printf("enter the mobile brand\n"); gets(find); for(int i=0; i<n; i++) { key = strcmp( a[i].brand , find ) ; if( key == 0 ) { printf("Mobile brand : %s \n", a[i].brand) ; printf("Quantity : %d \n", a[i].quantity) ; printf("Price : %d \n", a[i].price); } } } int main() { struct mobile m[3]; while(1) { printf("enter your choice \n 1.storting \n 2.searching\n 3.exit\n"); int ch; scanf("%d",&ch); switch(ch) { case 1: storing(m); break; case 2: search(m,3); break; case 3: exit(0); } } } what is wrong with this ?

When I'll be back home I'll give a look closer

#include<stdio.h> #include<string.h> #include<stdlib.h> struct mobile { char brand[27]; int quantity; int price; }; int count=0; void storing(struct mobile *ptr) { fflush(stdin); printf("\n\nEnter the details of %d mobile \n",count+1); printf("Brand name :"); gets(ptr[count]->brand) ; printf("Quantity :"); scanf("%d", &ptr[count]->quantity) ; printf("Price : "); scanf("%d", &ptr[count]->price) ; count++; } void search(struct mobile a[],int n) { fflush(stdin); int key; char find[27]; printf("enter the mobile brand\n"); gets(find); for(int i=0; i<n; i++) { key = strcmp( a[i].brand , find ) ; if( key == 0 ) { printf("Mobile brand : %s \n", a[i].brand) ; printf("Quantity : %d \n", a[i].quantity) ; printf("Price : %d \n", a[i].price); } } } int main() { struct mobile m[3]; while(1) { printf("enter your choice \n 1.storting \n 2.searching\n 3.exit\n"); int ch; scanf("%d",&ch); switch(ch) { case 1: storing(m); break; case 2: search(m,3); break; case 3: exit(0); } } } what is wrong with this ?

fflush(stdin);

What build system? OS?

Windows

use while(getchar() != '\n'); empty the stdin

where

use while(getchar() != '\n'); empty the stdin

After scanf and gets

bro what

?

https://pastebin.com/SAznbmgm

how can i get rid of this error?

if you end up inputting a value for num, which is less than 3 (which is the value you initialize i with), the loop will unfold from 3 to the maximum representable number with an integer (which in you system it will probably be somewhere between 2pow32 and 2pow64), and then it will overflow, and start from 0 again. so TLDR; just check that the inputed number is not less than 3, and if possible I would challenge the start value of i, which I am not sure why starts from three (is it an assignment?)

you need to print N numbers from the fibonacci sequence, right? so that if I input, 10, it should output something like: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 ...

Hi! I know include the string header is required to use string library. Why in some IDE as codeBlocks there is neither error nor warning when we don't include the header?

Sequence is easily calculated iteratively

yep, return n-1+n-2 when n>2

//Finding the elements of the fibonacci series when user inputs no of elements of the series #include<stdio.h> void main() { int n1=0, n2=1, n3, num; printf("Enter number of elements of the fibonacci series"); scanf("%d", &num); for(int i=3; i<=num; i++) { n3=n1+n2; printf("%d ", n3); n1=n2; n2=n3; } }

auto a = 0ULL; auto b = 1ULL; while(N--) { auto temp = a + b; std::swap(a, b); b = temp; }

The Fibonnacci series has 2 ones to begin with. And you are not printing the first n elements. You are printing n elements starting from the 2nd element. Fibonacci is an exponential series. So numbers grow very fast. Use an unsigned long long instead of int. What is the value of num for which you got Time Limit Exceeded.

Because those IDEs use what is called precompiled headers and most of the ones that are used regularly are automatically included for your convenience. Btw PCH has got nothing to do with this convenience. It is something that is done to save compilation time. You can disable this option.

The Fibonnacci series has 2 ones to begin with. And you are not printing the first n elements. You are printing n elements starting from the 2nd element. Fibonacci is an exponential series. So numbers grow very fast. Use an unsigned long long instead of int. What is the value of num for which you got Time Limit Exceeded.

I also changed the datatype to %lld still the error is there

what is the error?

//Finding the elements of the fibonacci series when user inputs no of elements of the series #include<stdio.h> void main() { int n1=0, n2=1, n3, num; printf("Enter number of elements of the fibonacci series"); scanf("%d", &num); for(int i=3; i<=num; i++) { n3=n1+n2; printf("%d ", n3); n1=n2; n2=n3; } }

It is taking a lot of time to print the statement "enter the number of elements of the fibonacci series"

this is my code and the error: process killed because it took more than 10 seconds

Nah this aint gonna cut it

//Fibonacci Series using Recursion #include<stdio.h> int fib(int n) { if (n <= 1) return n; return fib(n-1) + fib(n-2); } int main () { int n = 9; printf("%d", fib(n)); getchar(); return 0; } https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/

This one isn't linear

so?

and?

if you're saying to just compute a recursive fibonacci approach, it' OK, but it's only for someone who's starting out at recursion - "it ain't no free real estate" else, if you're gonna use recursion anyway, use dynamic programming

maybe I am missing the context, but I think I was answering to somebody having a problem with some (assignment?) code, so I assume the best way to help somebody who is trying to understand how to model a solution, is to show the easiest and "classical" way to do it

maybe I am missing the context, but I think I was answering to somebody having a problem with some (assignment?) code, so I assume the best way to help somebody who is trying to understand how to model a solution, is to show the easiest and "classical" way to do it

maybe I am missing the context, but I think I was answering to somebody having a problem with some (assignment?) code, so I assume the best way to help somebody who is trying to understand how to model a solution, is to show the easiest and "classical" way to do it

but if the "assignment" is on recursion, without DP, you can't help it

true, but that's out of my scope :D

N around 10 secs in that online gcc compiler

It is a problem on your system then. It works fine elsewhere

if you're saying to just compute a recursive fibonacci approach, it' OK, but it's only for someone who's starting out at recursion - "it ain't no free real estate" else, if you're gonna use recursion anyway, use dynamic programming