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

相关推荐
pianmian13 小时前
python数据结构基础(7)
数据结构·算法
闲晨3 小时前
C++ 继承:代码传承的魔法棒,开启奇幻编程之旅
java·c语言·开发语言·c++·经验分享
好奇龙猫5 小时前
【学习AI-相关路程-mnist手写数字分类-win-硬件:windows-自我学习AI-实验步骤-全连接神经网络(BPnetwork)-操作流程(3) 】
人工智能·算法
sp_fyf_20245 小时前
计算机前沿技术-人工智能算法-大语言模型-最新研究进展-2024-11-01
人工智能·深度学习·神经网络·算法·机器学习·语言模型·数据挖掘
香菜大丸6 小时前
链表的归并排序
数据结构·算法·链表
jrrz08286 小时前
LeetCode 热题100(七)【链表】(1)
数据结构·c++·算法·leetcode·链表
oliveira-time6 小时前
golang学习2
算法
南宫生7 小时前
贪心算法习题其四【力扣】【算法学习day.21】
学习·算法·leetcode·链表·贪心算法
懒惰才能让科技进步7 小时前
从零学习大模型(十二)-----基于梯度的重要性剪枝(Gradient-based Pruning)
人工智能·深度学习·学习·算法·chatgpt·transformer·剪枝
DARLING Zero two♡7 小时前
关于我、重生到500年前凭借C语言改变世界科技vlog.16——万字详解指针概念及技巧
c语言·开发语言·科技