AI Coding & CSE Fundamentals

Let's learn about Functions and Recursion in C! 🚀 This is a fundamental concept, so let's break it down step-by-step. **What are Functions?** ⚙️ Think of functions as mini-programs within your main program. They perform specific tasks. Imagine a function that adds two numbers or a function that prints a greeting. The whole purpose of functions are to avoid rewriting the same code again and again. Functions help us to write a more modular and organized code. **1. Simple Printing Functions (The Starting Point)** 📣 Let's start with a function that just prints something on the screen.

#include <stdio.h>

void printHello() {
    printf("Hello, world!n");
}

int main() {
    printHello(); // Calling or invoking the function
    return 0;
}

- `void printHello()`: This declares a function named `printHello`. - `void`: This means the function doesn't return any value. It just does something (in this case, printing). - `printHello()`: This is the name of the function. Choose descriptive names! - `{}`: The curly braces contain the code that the function executes. - `printf("Hello, world!\n");`: This line prints "Hello, world!" to the console. `\n` adds a newline character (moves the cursor to the next line). - `main()`: This is the main function, where the program execution begins. - `printHello();`: This *calls* or *invokes* the `printHello` function. When the program reaches this line, it jumps to the `printHello` function, executes its code, and then returns to the next line in `main()`. **2. Functions with Return Types (Giving Back Results)** ↩️ Sometimes, you want a function to calculate something and give you the result. This is where return types come in.

#include <stdio.h>

int add(int a, int b) {
    int sum = a + b;
    return sum;
}

int main() {
    int result = add(5, 3);
    printf("The sum is: %dn", result);
    return 0;
}

- `int add(int a, int b)`: - `int`: This is the *return type*. It means the function will return an integer value. - `a` and `b`: These are *parameters*. They're like inputs to the function. `a` and `b` are integers. - `return sum;`: This statement sends the value of `sum` back to the calling function (`main()`). - `int result = add(5, 3);`: In `main()`, we call the `add` function with the values 5 and 3. The returned value (8) is then stored in the `result` variable. **3. Parameters (Passing Information to Functions)** ➡️ Parameters are variables that you pass into a function. They allow you to give functions different inputs each time you call them.

#include <stdio.h>

void greet(char name[]) {
    printf("Hello, %s!n", name);
}

int main() {
    greet("Alice");
    greet("Bob");
    return 0;
}

- `char name[]`: This declares a parameter named `name` which is an array of characters (a string). The function takes a string as input. - `greet("Alice")`: When we call `greet("Alice")`, the string "Alice" is passed as the value of the `name` parameter. **4. Recursion (Functions Calling Themselves)** 🔄 Recursion is a powerful technique where a function calls *itself*. It's like looking in a mirror that reflects another mirror, and so on. 🤯 You need a "base case" to stop the recursion, or it will go on forever (or until your program crashes!).

#include <stdio.h>

int factorial(int n) {
    // Base case:
    if (n == 0) {
        return 1;
    }
    // Recursive step:
    else {
        return n * factorial(n - 1);
    }
}

int main() {
    int result = factorial(5);
    printf("Factorial of 5 is: %dn", result);
    return 0;
}

- `factorial(int n)`: This function calculates the factorial of a number `n`. - Base Case: `if (n == 0) { return 1; }`: The factorial of 0 is 1. This is the base case that stops the recursion. ⚠️ Without a base case, the function would call itself infinitely! - Recursive Step

Loop Control with Bit Shifting

#include <stdio.h>

int main() {
  int i = 8;
  int count = 0;
  for (; i; i >>= 1) {
    printf("%d ", i);
    count++;
  }
  printf("\nLoop ran %d times.\n", count);
  return 0;
}

Skip Specific Values with 'continue' in a Loop

#include <stdio.h>

int main() {
  for (int i = 1; i <= 10; i++) {
    if (i == 5 || i == 7) {
      continue;
    }
    printf("%d ", i);
  }
  printf("\n");
  return 0;
}

Infinite Loops with Break

#include <stdio.h>

int main() {
 int i = 0;
 while (1) {
 printf("%d ", i);
 i++;
 if (i > 9) {
 break;
 }
 }
 printf("\nLoop finished!\n");
 return 0;
}

Print Continuous Character Pattern A-B-C...

#include <stdio.h>

int main() {
 char ch;
 for (ch = 'A'; ch <= 'Z'; ch++) {
 printf("%c", ch);
 if (ch < 'Z') {
 printf("-");
 }
 }
 printf("\n");
 return 0;
}

Number Pyramid Pattern

#include <stdio.h>

int main() {
    int rows, num = 1;
    scanf("%d", &rows);

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

👨‍💻Happy to hear that many of you have been using the Interactive Code Explainer for getting code explaination, and I’d love to hear your thoughts! 💬 What did you like? What could be made better? Feel free to share your feedback by dropping a comment on my LinkedIn post 👇 🔗 https://www.linkedin.com/posts/sai-pradeep-875742268_codelearning-webdevelopment-reactjs-activity-7350843865475506176-BG9S Every suggestion helps to make the tool smarter, smoother, and more helpful for everyone! 🚀

Hollow Square Star Pattern

#include <stdio.h>

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i == 0 || i == n - 1 || j == 0 || j == n - 1) {
        printf("*");
      } else {
        printf(" ");
      }
    }
    printf("\n");
  }
  return 0;
}

Multiplication Table with Break and Continue

#include <stdio.h>

int main() {
    int rows = 5, cols = 5;

    for (int i = 1; i <= rows; i++) {
        for (int j = 1; j <= cols; j++) {
            if (i == 3 && j == 2) {
                continue;
            }
            if (i == 4 && j == 4) {
                break;
            }
            printf("%d * %d = %d\t", i, j, i * j);
        }
        printf("\n");
    }
    return 0;
}

Detect Duplicate Input Using While Loop

#include <stdio.h>

int main() {
    int num, prevNum = -1;
    while (1) {
        printf("Enter a number: ");
        scanf("%d", &num);
        if (num == prevNum) {
            printf("Duplicate detected: %d\n", num);
            break;
        }
        prevNum = num;
    }
    return 0;
}

Reverse Number Printing with do-while Loop

#include <stdio.h>

int main() {
  int n;
  scanf("%d", &n);
  do {
    printf("%d ", n);
    n--;
  } while (n >= 1);
  printf("\n");
  return 0;
}

Print Alphabets A to Z using While Loop

#include <stdio.h>

int main() {
 char alphabet = 'A';

 while (alphabet <= 'Z') {
 printf("%c ", alphabet);
 alphabet++;
 }

 printf("\n");
 return 0;
}

Even and Odd Numbers using While Loop

#include <stdio.h>

int main() {
  int N, i = 1;
  printf("Enter the value of N: ");
  scanf("%d", &N);

  printf("Even numbers: ");
  while (i <= N) {
    if (i % 2 == 0) {
      printf("%d ", i);
    }
    i++;
  }
  printf("\n");

  i = 1;
  printf("Odd numbers: ");
  while (i <= N) {
    if (i % 2 != 0) {
      printf("%d ", i);
    }
    i++;
  }
  printf("\n");
  return 0;
}

Guessing Game (do-while Loop)

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int main() {
    int number, guess, attempts = 0;
    srand(time(0));
    number = rand() % 100 + 1;

    do {
        printf("Guess a number between 1 and 100: ");
        scanf("%d", &guess);
        attempts++;

        if (guess > number) {
            printf("Too high!\n");
        } else if (guess < number) {
            printf("Too low!\n");
        } else {
            printf("Correct! You guessed in %d attempts.\n", attempts);
        }
    } while (guess != number);

    return 0;
}

Diamond Star Pattern

#include <stdio.h>

int main() {
  int rows, i, j, space;
  rows = 5;

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

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

  return 0;
}

Inverted Pyramid Pattern (Nested Loops)

#include <stdio.h>

int main() {
  int rows, i, j, space;

  rows = 5;

  for (i = rows; i >= 1; --i) {
    for (space = 0; space < rows - i; ++space)
      printf("  ");

    for (j = i; j <= 2 * i - 1; ++j)
      printf("* ");

    for (j = 0; j < i - 1; ++j)
      printf("* ");

    printf("\n");
  }

  return 0;
}

Right-Angle Star Pyramid (Nested Loops)

#include <stdio.h>

int main() {
 int rows, i, j;
 scanf("%d", &rows);
 for (i = 1; i <= rows; i++) {
 for (j = 1; j <= i; j++) {
 printf("*");
 }
 printf("\n");
 }
 return 0;
}

Pascal's Triangle (Loops)

#include <stdio.h>

int main() {
    int rows, i, j, space, number = 1;
    printf("Enter number of rows: ");
    scanf("%d", &rows);

    for (i = 0; i < rows; i++) {
        for (space = 1; space <= rows - i; space++)
            printf("  ");

        for (j = 0; j <= i; j++) {
            if (j == 0 || i == 0)
                number = 1;
            else
                number = number * (i - j + 1) / j;

            printf("%4d", number);
        }
        printf("\n");
    }
    return 0;
}

Floyd's Triangle (for loop)

#include <stdio.h>

int main() {
  int rows, num = 1;
  scanf("%d", &rows);

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

Multiplication Table (for loop)

#include <stdio.h>

int main() {
  int n, i;
  printf("Enter a number: ");
  scanf("%d", &n);

  for (i = 1; i <= 10; i++) {
    printf("%d * %d = %d\n", n, i, n * i);
  }
  return 0;
}