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

Transpose of Matrix in C

Transpose of a Matrix in C

✅ Transpose of a Matrix in C

#include <stdio.h>

int main() {
    int row, col;

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

    int matrix[row][col], transpose[col][row];

    printf("Enter %d elements in the matrix:\n", row * col);
    for(int i = 0; i < row; i++) {
        for(int j = 0; j < col; j++) {
            scanf("%d", &matrix[i][j]);
        }
    }

    // Print Original Matrix
    printf("\nOriginal Matrix:\n");
    for(int i = 0; i < row; i++) {
        for(int j = 0; j < col; j++) {
            printf("%d ", matrix[i][j]);
        }
        printf("\n");
    }

    // Transpose the matrix
    for(int i = 0; i < row; i++) {
        for(int j = 0; j < col; j++) {
            transpose[j][i] = matrix[i][j];
        }
    }

    // Print Transposed Matrix
    printf("\nTransposed Matrix:\n");
    for(int i = 0; i < col; i++) {
        for(int j = 0; j < row; j++) {
            printf("%d ", transpose[i][j]);
        }
        printf("\n");
    }

    return 0;
}
  

๐Ÿ“˜ Explanation:

In this program, we read a 2D matrix from the user and then print its transpose. A transpose of a matrix is formed by interchanging its rows and columns. For example, if element matrix[i][j] is at row i and column j, then it is placed at transpose[j][i] in the transposed matrix.

This method is useful in applications like image processing, solving systems of linear equations, and matrix algebra.

The user first inputs the number of rows and columns. The program then takes all matrix values, prints the original matrix, computes its transpose, and prints the result.

๐Ÿงพ Sample Output:

Enter number of rows and columns:
2 3
Enter 6 elements in the matrix:
1 2 3
4 5 6

Original Matrix:
1 2 3
4 5 6

Transposed Matrix:
1 4
2 5
3 6
  

๐Ÿ”‘ Keywords:

Transpose of Matrix in C, Matrix Transpose C Program, C language 2D Arrays, Matrix Programs in C, C Program with Input and Output, Matrix Logic in C, Transpose Algorithm in C, C Coding Examples, Beginner C Programs

๐Ÿ“Œ Hashtags:

#CProgramming #MatrixTranspose #CPrograms #2DArrays #TransposeInC #CodingInC #BeginnerFriendly #CLanguage

Comments

Popular Posts

๐ŸŒ™