C++ Codes - Basic to Advanced 💻

https://t.me/java_programming_language_code ☝️Along with Leetcode codes solved

https://t.me/student_deals_loots ☝️ join our deals channel for best laptop,mobile ...

https://t.me/java_programming_language_code join for java programming ☝️

🔥🔥HP Laptop 15, 13th Gen Intel Core i5-1335U (8GB RAM) Best for students @ 58,790 better go for 16gb ram if you can spend a little more Buy here- 👉https://studentsavingshub.blogspot.com/2024/01/hp-laptop-15-13th-gen-intel-core-i5.html Enjoy Shopping

ASUS Zenbook 14X OLED, Intel Core i5-12500H 12th Gen @67,990 Best processer,battery.. Buy Now- 👉https://studentsavingshub.blogspot.com/2024/01/asus-zenbook-14x-oled-intel-core-i5.html Enjoy Shopping for more join here- https://t.me/student_accessories_deals

🔥🔥HP Laptop 15, 13th Gen Intel Core i5-1335U (8GB RAM) Best for students @ 58,790 better go for 16gb ram if you can spend a little more Buy here- 👉https://studentsavingshub.blogspot.com/2024/01/hp-laptop-15-13th-gen-intel-core-i5.html Enjoy Shopping

void func(int n,int sum) { int k=0,j=0; if(n==0){ return; } k=n%10; j=n/10; sum=sum+k; func(j,sum); printf("%d",k); } int main() { int num=2024,sum=0; func(num,sum); return 0; }

#include<stdio.h> int func(int n) { static int i=1; if(n>=5){ return n; } n=n+i; i++; return func(n); } int main() { int r=func(2); printf("%d",r); return 0; }

⏩ Join our c programming community 👇 https://t.me/C_programming_language_group

Free C language basics course out now Free for only limited Enrollments Intrested ones Enroll fast👇 https://t.me/udemy_course_4u

// Program for finding a specific value in a fibonacci series #include<stdio.h> int fib(int n) { if(n<=1) return n; return fib(n-2) + fib(n-1); } int main() { printf("%d \n ",fib(10)); return 0; }

// Program for finding a specific value in a fibonacci series #include<stdio.h> int fib(int n) { if(n<=1) return n; return fib(n-2) + fib(n-1); }

// Program for taylors series using horner's rule #include<stdio.h> double e(int x,int n) { static double s=1.0; if(n==0) { return s; } s=1+x*s/n; return e(x,n-1); } int main() { int x,n; double r; printf("Enter the values of s and n:"); scanf("%d%d",&x,&n); r=e(x,n); printf("e^%d= %lf",x,r); }

// Program to find value of e^x using Taylors series with recursion #include<stdio.h> double e(int x,int n) { static double p=1,f=1; double res; if(n==0) { return 1; } else{ res=e(x,n-1); p=p*x; f=f*n; return res+p/f; } } int main() { int x,n; double r; printf("Enter the values of s and n:"); scanf("%d%d",&x,&n); r=e(x,n); printf("e^%d= %lf",x,r); }