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

Linear Search in an Array - C Program

Linear Search in Array - C Program

✅ Linear Search in an Array - C Program

#include <stdio.h>

int main() {
    int size, key, found = 0;

    // Input the size of the array
    printf("Enter the size of the array:\n");
    scanf("%d", &size);

    if (size <= 0) {
        printf("Invalid array size!\n");
        return 1;
    }

    int arr[size];

    // Input array elements
    printf("Enter %d elements:\n", size);
    for (int i = 0; i < size; i++) {
        scanf("%d", &arr[i]);
    }

    // Input the element to search
    printf("Enter the element to search:\n");
    scanf("%d", &key);

    // Search for the element
    for (int i = 0; i < size; i++) {
        if (arr[i] == key) {
            printf("Element %d found at index %d (position %d)\n", key, i, i + 1);
            found = 1;
            break;
        }
    }

    if (!found) {
        printf("Element %d not found in the array.\n", key);
    }

    return 0;
}
  

๐Ÿ“˜ Explanation:

This program demonstrates a simple linear search in an array. It takes the array size and elements from the user, along with the target value to search. It then loops through the array and checks for equality with the given key. If found, it prints the index and position. If the element is not present, it informs the user accordingly. The `break` statement is used to stop at the first occurrence.

๐Ÿงพ Sample Output:

Enter the size of the array:
5
Enter 5 elements:
10 20 30 40 50
Enter the element to search:
30
Element 30 found at index 2 (position 3)
  

๐Ÿ”‘ Keywords:

Array Search in C, Linear Search Program, Find Index of Element, C Array Program, Beginner C Code, Searching in Arrays

๐Ÿ“Œ Hashtags:

#CProgramming #ArraySearch #LinearSearch #BeginnerC #CCodeWithExplanation #DataSearch

Comments

Popular Posts

๐ŸŒ™