Skip to main content

Featured

C Program to Check Prime Number Using Efficient Logic

  Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design.  Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...
Post a Comment
Read more
Labels

Recursive String Reversal in C

Recursive String Reversal in C

✅ Recursive String Reversal in C

#include <stdio.h>
#include <string.h>

// Recursive function to reverse the string
void reverseString(char str[], int start, int end) {
    if (start >= end)
        return;

    // Swap characters
    char temp = str[start];
    str[start] = str[end];
    str[end] = temp;

    // Recur for next pair
    reverseString(str, start + 1, end - 1);
}

int main() {
    char str[100];
    printf("Enter a string:\n");
    scanf(" %[^\n]", str);  // Read string with spaces

    printf("Original String: %s\n", str);
    
    reverseString(str, 0, strlen(str) - 1);

    printf("Reversed String: %s\n", str);

    return 0;
}

📘 Explanation:

This program demonstrates how to reverse a string using a recursive approach:

  • It defines a recursive function reverseString() that swaps characters from the beginning and end, moving toward the center.
  • Base case: if start >= end, the function returns.
  • Each recursive call handles the next inner pair of characters.
  • scanf(" %[^\n]", str) reads input including spaces.

🧾 Sample Output:

Enter a string:
hello world
Original String: hello world
Reversed String: dlrow olleh

🔑 Keywords:

Recursion in C, reverse string recursively, string functions in C, string reverse logic, string manipulation, reverse using function

📌 Hashtags:

#CProgramming #Recursion #StringReversal #BeginnerC #CodeWithC #StringLogic

Labels:

Comments

Post a Comment

Popular Posts

🌙