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: Final Sum of Max Row and Min Column

C Program: Final Sum of Max Row and Min Column

๐Ÿ”ท C Program: Final Sum of Max Row and Min Column

#include <stdio.h>

int main()
{
    int n, m;
    printf("Enter the number of rows (N): ");
    scanf("%d", &n);
    printf("Enter the number of coloumns (M): ");
    scanf("%d", &m);

    int a[n][m];

    printf("Enter the elements of the array:\n");
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            scanf("%d", &a[i][j]);
        }
    }

    int max_row_sum = 0;
    for (int i = 0; i < n; i++)
    {
        int row_sum = 0;
        for (int j = 0; j < m; j++)
        {
            row_sum += a[i][j];
        }
        if (i == 0 || row_sum > max_row_sum)
        {
            max_row_sum = row_sum;
        }
    }

    int min_col_sum = 0;
    for (int j = 0; j < m; j++)
    {
        int col_sum = 0;
        for (int i = 0; i < n; i++)
        {
            col_sum += a[i][j];
        }
        if (j == 0 || col_sum < min_col_sum)
        {
            min_col_sum = col_sum;
        }
    }

    int final_sum = max_row_sum + min_col_sum;
    printf("\nsum of row with highest sum: %d\n", max_row_sum);
    printf("sum of column with lowest sum: %d\n", min_col_sum);
    printf("Final sum (Largest row sum + smallest column sum): %d\n", final_sum);

    return 0;
}
  

๐Ÿ“˜ Explanation:

This C program works on a 2D array (matrix) and calculates two things:

๐Ÿ”น Maximum Row Sum: The sum of the row which has the highest total.
๐Ÿ”น Minimum Column Sum: The sum of the column which has the smallest total.

๐Ÿ”น After collecting user input into the matrix, it traverses each row to find the maximum row sum.
๐Ÿ”น Then it traverses each column to find the minimum column sum.
๐Ÿ”น It adds both to compute the final_sum and displays all three values: max row sum, min col sum, and their sum.

๐Ÿ” Sample Output:

Enter the number of rows (N): 3
Enter the number of coloumns (M): 3
Enter the elements of the array:
1 2 3
4 5 6
7 8 9

sum of row with highest sum: 24
sum of column with lowest sum: 12
Final sum (Largest row sum + smallest column sum): 36
    

๐Ÿท️ Keywords:

2D array in C, row sum, column sum, max row, min column, matrix manipulation in C, matrix row column sum program

Comments

Popular Posts

๐ŸŒ™