Skip to main content

Featured

Merge Sort in C++

  Merge Sort in C++ Introduction Merge Sort is a popular sorting algorithm that follows the Divide and Conquer approach. It divides an array into smaller subarrays, recursively sorts those subarrays, and finally merges the sorted subarrays to produce a completely sorted array. In this tutorial, we will learn how to implement Merge Sort in C++ . The program divides the array into two halves using the mid index, recursively sorts both halves, and then combines them using the merge() function. Merge Sort has a time complexity of O(n log n) in the best, average, and worst cases. Table of Contents Algorithm C++ Program Input Sample Output Output Explanation Dry Run Flow of Execution Time Complexity Space Complexity Applications Key Points Interview Questions Frequently Asked Questions Keywords Conclusion Algorithm Start the program. Read the size of the array. Read the array elements from the user. Call the mer...

Check Palindrome and Reverse String in C

Check Palindrome and Reverse String in C

✅ Check Palindrome and Reverse a String in C

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

// Function to check if string is palindrome
int pal(char str[]) {
    int left = 0, right = strlen(str) - 1;
    while (left < right) {
        if (str[left] != str[right]) {
            printf("No, Entered string is not a palindrome.\\n");
            return 0;
        }
        left++;
        right--;
    }
    printf("Yes, Entered string is a palindrome.\\n");
    return 1;
}

// Function to reverse the string
void reverse(char str[]) {
    int start = 0, end = strlen(str) - 1;
    while (start < end) {
        char temp = str[start];
        str[start] = str[end];
        str[end] = temp;
        start++;
        end--;
    }
}

int main() {
    char str[100];
    printf("Enter the string:\\n");
    scanf(" %[^\n]", str);

    printf("Before Reversing: %s\\n", str);
    pal(str);              // Check palindrome before reversing
    reverse(str);
    printf("After Reversing: %s\\n", str);

    return 0;
}
  

๐Ÿ“˜ Explanation:

✅ This program reads a string from the user.
✅ It first checks whether the input string is a palindrome by comparing characters from both ends.
✅ If the string is not a palindrome, it notifies the user.
✅ Then it reverses the string using a two-pointer method and prints the reversed result.
✅ It uses strlen, scanf, and character swapping.

๐Ÿงพ Sample Output:

Enter the string:
madam
Before Reversing: madam
Yes, Entered string is a palindrome.
After Reversing: madam
  

๐Ÿ”‘ Keywords:

Palindrome check C, reverse string in C, C string programs, string palindrome logic, two pointer technique, string manipulation

๐Ÿ“Œ Hashtags:

#CProgramming #PalindromeCheck #ReverseString #StringHandling #BeginnersC #InterviewPrep #StringFunctions

Comments

Popular Posts

๐ŸŒ™