<算法编程> 给定二维数组查找一个数是否存在在这个数组中

#include<iostream>
using namespace std;

bool FindNum(int arr[][5],int rows,int cols,int num)
{
    if(arr == NULL || rows <= 0 || cols <= 0) return false;

    for(int row=rows-1,col=0;row>=0&&col<cols;)
    {
        if(num < arr[row][col])
        {
            row --;
            continue;
        }
        if(num > arr[row][col])
        {
            col ++;
            continue;
        }
        if(num == arr[row][col])
            return true;
    }
    return false;
}

int main()
{
    int arr[5][5] = {{2,4,5,6,7},
                     {5,8,13,17,22},
                     {7,9,24,26,30},
                     {11,18,27,31,45},
                     {19,20,28,32,50}};
    int num;
    cin >> num;
    if(FindNum(arr,5,5,num))
        cout << "find success!" << endl;
    else 
        cout << "find failed!" << endl;
    
    system("pause");
    return 0;
}