Let's say recursion is like Induction

😭😭😭 im getting crazy

😭😭😭 im getting crazy

https://www.tutorialspoint.com/cprogramming/c_recursion.htm

Hello everybody

Please solve my problem

https://www.tutorialspoint.com/cprogramming/c_recursion.htm

You don't have for beginners Shelly ?

You don't have for beginners Shelly ?

This is pretty easy and for beginners

This is pretty easy and for beginners

Yeah

You can't explain recursion even more easy

Hey please solve my problem

Tutorialspoint is a good start

im taking a look

thanks guys

This is pretty easy and for beginners

I m using c++

I m using c++

Nice

Nice

I want a simple book I 've a book with 400 pages

an user suppose to enter a number and then, the program will make the decision if it is prime or not and loop it

and wow your code is good

only one thing i'd change is have the "init" fuction be just isPrime and have the other be isPrimeRecurs or something, as it'll both be more accurate and more understandable

taking a look, it has the for loop and i cant

taking a look, it has the for loop and i cant

no

he wrote that to show the algorithm

check the second snippet

oh ya ya

wow

but my question is, where i can put the option for the user

check the second snippet

why is the isPrimeRecurs(107)

why is the isPrimeRecurs(107)

he calls the function and that returns true or false, depending on if the number is prime

he added 107 as an example

that should be the number you want to check

i should let the user enter any number they want

Hii

i should let the user enter any number they want

well just store the input on a variable and pass that to the function

well just store the input on a variable and pass that to the function

and the variable should be outside the main, right?

and the variable should be outside the main, right?

it doesn't have to be

and the scanf have to be isPrimeRecurs?

and the scanf have to be isPrimeRecurs?

what do you mean?

just use scanf to store the input in a variable

then replace 107 with that variable

ok, what i know is that, if I introduce a number, it has to be scanned to store it in the varaible and then, a printf to show it

yes

in the printf use the result of isPrimeRecurs

what don't you understand exactly?

ok let me show you

int isPrimeRecurs2(int n, int i); int isPrimeRecurs(int n) { if(n <= 1) return 0; if(n == 2) return 1; if(n % 2 == 0) return 0; return isPrimeRecurs2(n, 3); } int isPrimeRecurs2(int n, int i) { if(i > sqrt(n)) return 1; if(n % i == 0) return 0; return isPrimeRecurs2(n, i + 2); } and call int main() { printf("Please enter a number"); scanf("%i", isPrimeRecurs); printf("%i \n", isPrimeRecurs); }

that should be the entire program?

take a look at the main

in the printf use the result of isPrimeRecurs

^

take a look at the main

no

store it in a variable

#ot

you should make your functions return bools tho

oh

true

oooh got it!!!!!!!! omg im so sorry, i was very confused

thanks!

7 is a primer number, right?

y

the code says it's not

do you try dividing by 1?

do you try dividing by 1?

let me see

not sure exactly what you're trying to prove by that tbh

an object that can store 0 or 1 is exactly what you're looking for

do you try dividing by 1?

Good night all of you

Good night all of you

good night!

guys

literally I do not know how to make the loop

@mmihov you there?

Yes

And don't PM me

vehlwn was helping me a lot

but he got to go

and literally the program is done except for the recursion

and he texted me this

every loop like: for(int i = 0; i <= k; i += 2) { if(check(i)) return; } can be rewritten with tail recursion functions like: callLoop() { // pass initial value for loop counter callLoop2(0); } callLoop2(int i) { // check stop conditions if(!(i <= k)) reutrn; if(check(i)) reutrn; // simulate loop iteration and increment loop counter callLoop2(i + 2); } in you task you need more conditions in 1st function and pass n as additional parameter: isPrimeRecurs(int n) { if(n <= 1) return 0; if(n == 2) return 1; if(n % 2 == 0) return 0; callLoop2(n, 3); } isPrimeRecurs2(int n, int i) { // check stop conditions if(i > floor(sqrt(n))) return 1; if(n % i == 0) return 0; // simulate loop iteration and increment loop counter return isPrimeRecurs2(n, i + 2); }

but I do not understand how to apply that callLoop into the code