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...

C program to implement a custom strstr() function to check if one string is a substring of another

Custom strstr() Function in C

๐Ÿ”ถ Custom strstr() Function in C

#include <stdio.h>

// Custom strstr function
int my_strstr(char *str1, char *str2) {
    int i, j;
    for (i = 0; str1[i] != '\0'; i++) {
        for (j = 0; str2[j] != '\0'; j++) {
            if (str1[i + j] != str2[j]) {
                break;
            }
        }
        // If full substring matched
        if (str2[j] == '\0') {
            return 1;
        }
    }
    return 0;
}

int main() {
    char str1[100], str2[100];

    printf("Enter string1: ");
    scanf("%s", str1);

    printf("Enter string2: ");
    scanf("%s", str2);

    if (my_strstr(str1, str2)) {
        printf("String2 is a substring of string1\n");
    } else {
        printf("String2 is not a substring of string1\n");
    }

    return 0;
}
  

๐Ÿ“˜ Explanation:

This C program defines a custom version of the strstr() function to check whether one string is a substring of another.

๐Ÿ”น The outer loop goes through each character of the main string str1.
๐Ÿ”น The inner loop checks if all characters of str2 match starting from current index in str1.
๐Ÿ”น If all characters of str2 match (end of str2 is reached), the function returns 1 (true).
๐Ÿ”น Otherwise, it continues to the next position.
๐Ÿ”น If no match is found by the end of the loop, it returns 0 (false).

๐Ÿ” Sample Output:

Enter string1: hello
Enter string2: ell
String2 is a substring of string1

Enter string1: openai
Enter string2: bot
String2 is not a substring of string1
    

๐Ÿท️ Keywords:

custom strstr in C, substring check program, string functions in C, how to check substring manually in C, C interview string question, nested loop string match

Comments

Popular Posts

๐ŸŒ™