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程序设计---谭浩强》

相关推荐
B612 little star king几秒前
力扣29. 两数相除题解
java·算法·leetcode
野犬寒鸦1 分钟前
力扣hot100:环形链表(快慢指针法)(141)
java·数据结构·算法·leetcode·面试·职场和发展
时光追逐者6 分钟前
C# 哈希查找算法实操
算法·c#·哈希算法
Jasmine_llq30 分钟前
《P3825 [NOI2017] 游戏》
算法·游戏·枚举法·2-sat 算法·tarjan 算法·邻接表存储
Miraitowa_cheems34 分钟前
LeetCode算法日记 - Day 38: 二叉树的锯齿形层序遍历、二叉树最大宽度
java·linux·运维·算法·leetcode·链表·职场和发展
wangzy198234 分钟前
图形基础算法:如何将点与带曲线边的多边形位置关系算法做稳定
算法
艾醒1 小时前
探索大语言模型(LLM):Ollama快速安装部署及使用(含Linux环境下离线安装)
人工智能·深度学习·算法
劲镝丶1 小时前
malloc概述
c语言·开发语言·c++
艾醒1 小时前
探索大语言模型(LLM):Open-WebUI的安装
人工智能·算法·全栈
猫天意2 小时前
【CVPR2023】奔跑而非行走:追求更高FLOPS以实现更快神经网络
人工智能·深度学习·神经网络·算法·机器学习·卷积神经网络