C Programming Codes

#CProgramming #Recursion #DigitsSum

Unlocking Recursion: Can you sum the digits of a number recursively in C?

#include <stdio.h>

int sumOfDigits(int n) {
  if (n == 0)
    return 0;
  return (n % 10 + sumOfDigits(n / 10));
}

int main() {
  int num;
  scanf("%d", &num);
  printf("%d", sumOfDigits(num));
  return 0;
}

#Cprogramming #Recursion #PowerFunction

Recursive Power: Unleashing the Power of C Functions!

#include <stdio.h>

int power(int base, int exp) {
    if (exp == 0)
        return 1;
    else if (exp % 2 == 0) {
        int temp = power(base, exp / 2);
        return temp * temp;
    } else {
        return base * power(base, exp / 2) * power(base, exp / 2);
    }
}

int main() {
    int base, exp;
    printf("Enter base: ");
    scanf("%d", &base);
    printf("Enter exponent: ");
    scanf("%d", &exp);
    printf("%d^%d = %d", base, exp, power(base, exp));
    return 0;
}

#CProgramming #PrimeNumber #Algorithm

Is this number PRIME? C function to the rescue!

#include <stdio.h>
#include <stdbool.h>

bool isPrime(int n) {
  if (n <= 1) return false;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}

int main() {
  int num;
  printf("Enter a number: ");
  scanf("%d", &num);
  if (isPrime(num)) {
    printf("%d is a prime number.\n", num);
  } else {
    printf("%d is not a prime number.\n", num);
  }
  return 0;
}

#CProgramming #GCDLCM #Algorithms

Can you find the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) using functions in C?

#include <stdio.h>

int gcd(int a, int b) {
    if (b == 0) {
        return a;
    }
    return gcd(b, a % b);
}

int lcm(int a, int b) {
    return (a * b) / gcd(a, b);
}

int main() {
    int num1, num2;
    printf("Enter two positive integers: ");
    scanf("%d %d", &num1, &num2);

    printf("GCD of %d and %d is %d\n", num1, num2, gcd(num1, num2));
    printf("LCM of %d and %d is %d\n", num1, num2, lcm(num1, num2));

    return 0;
}

#CProgramming #Recursion #Fibonacci

Unlocking the Fibonacci Sequence: Can Recursion Show the Way?

#include <stdio.h>

int fibonacci(int n) {
    if (n <= 1)
        return n;
    return fibonacci(n - 1) + fibonacci(n - 2);
}

int main() {
    int n = 10;
    printf("Fibonacci sequence up to %d: ", n);
    for (int i = 0; i < n; i++) {
        printf("%d ", fibonacci(i));
    }
    printf("\n");
    return 0;
}

#CProgramming #Recursion #Factorial

Can Recursion Calculate Factorials in C?

#include <stdio.h>

int factorial(int n) {
 if (n == 0)
 return 1;
 else
 return n * factorial(n - 1);
}

int main() {
 int num = 5;
 printf("Factorial of %d is %d\n", num, factorial(num));
 return 0;
}

# C Functions & Recursion: Code Ninjas Unite! 🥷 Level up your C programming skills! Let's explore functions and recursion, powerful tools for writing clean and efficient code. ## What are Functions? 🤔 Imagine functions as mini-programs within your main program. They do specific tasks. * **Purpose:** Break down complex problems into smaller, manageable pieces. * **Benefit:** Code reusability! Write once, use many times. * **Example:** A function to calculate the area of a circle. You can call it whenever you need that calculation! ## Function Structure 🏗️ ```c // Function Declaration (Prototype) int add(int a, int b); // Function Definition int add(int a, int b) { return a + b; } // Function Call int result = add(5, 3); // result will be 8 ``` * **Declaration:** Tells the compiler about the function's name, return type, and parameters. * **Definition:** Contains the actual code that the function executes. * **Call:** Invokes the function, executing its code with specified arguments. ## Why Use Functions? 💡 * **Modularity:** Makes code easier to understand and maintain. * **Reusability:** Avoid writing the same code multiple times. * **Readability:** Improves the overall structure of your program. * **Debugging:** Simplifies the process of finding and fixing errors. ## Recursion: Functions Calling Themselves! 🔄 Think of recursion like a set of Russian nesting dolls. A function calls itself to solve smaller versions of the same problem. * **Base Case:** The condition that stops the recursion (essential!). * **Recursive Step:** The function calls itself with a modified input. ## Recursive Example: Factorial 🤯 ```c int factorial(int n) { if (n == 0) { // Base case: Factorial of 0 is 1 return 1; } else { return n * factorial(n - 1); // Recursive step } } ``` * `factorial(5)` becomes `5 * factorial(4)` which becomes `5 * 4 * factorial(3)` and so on until the base case. ## Recursion vs. Iteration ⚔️ Both solve repetitive tasks. Recursion can be elegant, but iteration (loops) is often more efficient in C. Choose wisely! * **Recursion:** Elegant, can be slower due to function call overhead. * **Iteration:** Usually faster, can be less readable for some problems. ## Level Up! 💪 Practice creating and using functions and recursive algorithms. Start with simple examples like calculating sums, finding maximums, or implementing Fibonacci sequences. You'll be a C code ninja in no time!

#Cprogramming #PascalTriangle #Algorithms

Unlocking Pascal's Triangle with C Code!

#include <stdio.h>

int main() {
    int rows, i, j, number = 1;

    printf("Enter the number of rows: ");
    scanf("%d", &rows);

    for (i = 0; i < rows; i++) {
        for (j = 0; j <= i; j++) {
            if (j == 0 || i == j) {
                number = 1;
            } else {
                number = number * (i - j + 1) / j;
            }
            printf("%4d", number);
        }
        printf("\n");
    }
    return 0;
}

#CProgramming #FloydsTriangle #Algorithms

Unlocking Floyd's Triangle: A Classic C Programming Puzzle!

#include <stdio.h>

int main() {
  int rows, number = 1;

  printf("Enter the number of rows: ");
  scanf("%d", &rows);

  for (int i = 1; i <= rows; i++) {
    for (int j = 1; j <= i; j++) {
      printf("%d ", number);
      number++;
    }
    printf("\n");
  }

  return 0;
}

#Cprogramming #StarPatterns #Algorithms

Can you create stunning star patterns in C?

#include <stdio.h>

void printPyramid(int rows) {
    for (int i = 1; i <= rows; i++) {
        for (int j = 1; j <= rows - i; j++) {
            printf(" ");
        }
        for (int k = 1; k <= 2 * i - 1; k++) {
            printf("*");
        }
        printf("\n");
    }
}

void printInvertedPyramid(int rows) {
    for (int i = rows; i >= 1; i--) {
        for (int j = 1; j <= rows - i; j++) {
            printf(" ");
        }
        for (int k = 1; k <= 2 * i - 1; k++) {
            printf("*");
        }
        printf("\n");
    }
}

void printDiamond(int rows) {
    printPyramid(rows);
    printInvertedPyramid(rows - 1);
}

int main() {
    int rows;
    printf("Enter the number of rows: ");
    scanf("%d", &rows);

    printf("\nPyramid:\n");
    printPyramid(rows);

    printf("\nInverted Pyramid:\n");
    printInvertedPyramid(rows);

    printf("\nDiamond:\n");
    printDiamond(rows);

    return 0;
}

#CProgramming #DigitsCount #Algorithm