Bool矩阵的操作,C语言实现

实验目的

Using C-language to achieve the Join and Meet operation of Boolean matrices.

实验内容

Input two matrices A and B, and calculate and output the meet of A and B, the join of A and B.

使用环境

Win 11 & visual studio code 2022

算法介绍

Algorithm: Define an array of variable sizes in a large range, input the number(0&1) to get the matrix. Use pointer function branches to determine the return address, calculate by retrieves the value in the address.

Input: matrices A and B

Output: the meet of A and B, the join of A and B.

Take Meet operation as an example

Begin: Compares whether the first digit of the array A is 0, if so, return the digit

Step 1: if not, comparing whether the second digit of the array B is 1. If so, return the second digit.

Step 2: if not, still return the second digit.

End: Compare them in order like this.

调试过程

调试代码

objectivec 复制代码
#include <stdio.h>

void input(int rows, int cols, int ar[][256]);
int* join(int rows, int cols, int ar1[][256], int ar2[][256]);
int* meet(int rows, int cols, int ar1[][256], int ar2[][256]);

int main(void)
{
    int M, N, i, j, * p;
    printf("please decide Rows and Columns of matrix: ");
    scanf("%d %d", &M, &N);
    int arry1[256][256];
    int arry2[256][256];
    input(M, N, arry1);
    printf("the next matrix ");
    input(M, N, arry2);
    printf("the meet of A and B:\n");
    for (i = 0; i <N; i++)
    {
        for (j = 0; j < M; j++)
        {
            p = meet(i, j, arry1, arry2);
            printf("%d ", *p);
        }
        printf("\n");
    }
    printf("\n");
    printf("the join of A and B:\n");
    for (i = 0; i < N; i++)
    {
        for (j = 0; j < M; j++)
        {
            p = join(i, j, arry1, arry2);
            printf("%d ", *p);
        }
        printf("\n");
    }
    getchar();
}

void input(int rows, int cols, int ar[][256])
{
    int i, j;
    printf("input: ");
    for (i = 0; i < rows; i++)
        for (j = 0; j < cols; j++)
        {
            scanf("%d", &ar[i][j]);
            getchar();
        }
}

int* meet(int rows, int cols, int ar1[][256], int ar2[][256])
{
    if (0 == ar1[rows][cols]) return &ar1[rows][cols];
    else
    {
        if (1 == ar2[rows][cols]) return &ar2[rows][cols];
        else return &ar2[rows][cols];
    }
}

int* join(int rows, int cols, int ar1[][256], int ar2[][256])
{
    if (1 == ar1[rows][cols]) return &ar1[rows][cols];
    else
    {
        if (0 == ar2[rows][cols]) return &ar2[rows][cols];
        else return &ar2[rows][cols];
    }
}

Another way to achieve the goal, the code removed the function of obtaining input.

objectivec 复制代码
#include <stdio.h>



void fun1(int (*P)[3]);

void meet(int (*P)[3],int (*Q)[3]);

void join(int (*P)[3],int (*Q)[3]);

void main()

{

    int arr1[3][3] = {{1, 0, 1}, {0, 1, 0}, {1, 1, 0}};

    int arr2[3][3] = {{0, 0, 1}, {1, 1, 0}, {0, 1, 1}};  //初始化数组

    fun1(arr1);

    printf("the other matrix: \n");

    fun1(arr2);

    printf("A∧B\n");

    meet(arr1,arr2);

    printf("A∨B\n");

    join(arr1,arr2);

    getchar();

}



void fun1(int (*P)[3])  //打印二维数组

{

    int i, j;

    for (i = 0; i < 3; i++)

    {

        for (j = 0; j < 3; j++)

        {

            printf("%2d", *(*(P + i) + j));

        }

        printf("\n");

    }

}



void meet(int (*P)[3],int (*Q)[3])

{

    int i, j;

    for (i = 0; i < 3; i++)

    {

        for (j = 0; j < 3; j++)

        {

            if (0 == *(*(P + i) + j)) printf("%2d", *(*(P + i) + j));

            else

            {

                if (1 == *(*(Q + i) + j)) printf("%2d", *(*(Q + i) + j));

                else printf("%2d", *(*(Q + i) + j));

            }

        }

        printf("\n");

    }

}



void join(int (*P)[3],int (*Q)[3])

{

    int i, j;

    for (i = 0; i < 3; i++)

    {

        for (j = 0; j < 3; j++)

        {

            if (1 == *(*(P + i) + j)) printf("%2d", *(*(P + i) + j));

            else

            {

                if (0 == *(*(Q + i) + j)) printf("%2d", *(*(Q + i) + j));

                else printf("%2d", *(*(Q + i) + j));

            }

        }

        printf("\n");

    }

}

运行结果

总结

This is just an algorithm that I came up with on a whim, and it might be more efficient to use Pointers of Pointers to traverse a two-dimensional array.

参考文献

《C prime plus》《C程序设计---谭浩强》

相关推荐
呆呆的小鳄鱼10 分钟前
leetcode:冗余连接 II[并查集检查环][节点入度]
算法·leetcode·职场和发展
墨染点香11 分钟前
LeetCode Hot100【6. Z 字形变换】
java·算法·leetcode
沧澜sincerely12 分钟前
排序【各种题型+对应LeetCode习题练习】
算法·leetcode·排序算法
CQ_071212 分钟前
自学力扣:最长连续序列
数据结构·算法·leetcode
弥彦_28 分钟前
cf1925B&C
数据结构·算法
Y4090011 小时前
C语言转Java语言,相同与相异之处
java·c语言·开发语言·笔记
YuTaoShao1 小时前
【LeetCode 热题 100】994. 腐烂的橘子——BFS
java·linux·算法·leetcode·宽度优先
Wendy14418 小时前
【线性回归(最小二乘法MSE)】——机器学习
算法·机器学习·线性回归
拾光拾趣录8 小时前
括号生成算法
前端·算法
棐木9 小时前
【C语言】动态内存管理
c语言·free·malloc·realloc·calloc·动态内存