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

Find Minimum and Maximum in 2D Array - C Program

Find Minimum and Maximum in 2D Array - C Program

✅ Find Minimum and Maximum in 2D Array - C Program

#include <stdio.h>

int main() {
    int row, col;

    // Input number of rows and columns
    printf("Enter number of rows and columns:\n");
    scanf("%d %d", &row, &col);

    int arr[row][col];

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

    // Initialize min and max with the first element
    int min = arr[0][0];
    int max = arr[0][0];

    // Traverse the array to find min and max
    for(int i = 0; i < row; i++) {
        for(int j = 0; j < col; j++) {
            if(arr[i][j] < min) {
                min = arr[i][j];
            }
            if(arr[i][j] > max) {
                max = arr[i][j];
            }
        }
    }

    // Print results
    printf("Minimum element = %d\n", min);
    printf("Maximum element = %d\n", max);

    return 0;
}
  

๐Ÿ“˜ Explanation:

This C program reads a 2D array (matrix) from the user, then traverses all its elements using nested loops to determine the minimum and maximum values. The min and max variables are initialized with the first element, and the program compares each subsequent value to update these accordingly. This logic is useful for matrix-based problems in C, including search, statistics, and data processing.

๐Ÿงพ Sample Output:

Enter number of rows and columns:
2 3
Enter 6 elements:
5 7 1 9 4 2
Minimum element = 1
Maximum element = 9
  

๐Ÿ”‘ Keywords:

2D Array in C, Matrix traversal, Find min in matrix, Find max in matrix, C program array problem, Nested loop logic in C

๐Ÿ“Œ Hashtags:

#CProgramming #2DArray #MatrixMinMax #BeginnerC #ArrayTraversal #CodingPractice

Comments

Popular Posts

๐ŸŒ™