<offer4> 04_FindInPartiallySortedMatrix

 #include<cstdio>

 bool Find(int* matrix, int rows, int columns, int number)
 {
     bool result = false;
     if(matrix != nullptr && rows >  && columns > )
     {
         int row_begin = ;
         int col_begin = columns - ; //3  [0, 3]

         while (columns >=  && row_begin < rows)
         {
             if (matrix[row_begin*columns + col_begin] == number)
             {
                 result = true;
                 return result;
             }
             else if (matrix[row_begin*columns + col_begin] > number)
                 col_begin--; //  2 1
             else
                 row_begin++;
         }
     }
     return result;
 }

 void Test(char* testName, int* matrix, int rows, int columns, int number, bool expected)
 {
     if (testName != nullptr)
         printf("%s begins: ", testName);
     bool result = Find(matrix, rows, columns, number);
     if (result == expected)
     {
         printf("passed.\n");
     }
     else
         printf("failed.\n");
 }

 void Test1()
 {
     int matrix[][] = { {,,,},{,,,},{,,,},{,,,} };
     Test("Test1", (int*)matrix, , , , true);
 }
 void Test2()
 {
     int matrix[][] = { { ,,, },{ ,,, },{ ,,, },{ ,,, } };
     Test("Test1", (int*)matrix, , , , false);
 }
 void Test3()
 {
     int matrix[][] = { { ,,, },{ ,,, },{ ,,, },{ ,,, } };
     Test("Test1", (int*)matrix, , , , true);
 }
 void Test4()
 {
     int matrix[][] = { { ,,, },{ ,,, },{ ,,, },{ ,,, } };
     Test("Test1", (int*)matrix, , , , true);
 }
 void Test5()
 {
     int matrix[][] = { { ,,, },{ ,,, },{ ,,, },{ ,,, } };
     Test("Test1", (int*)matrix, , , , false);
 }
 void Test6()
 {
     int matrix[][] = { { ,,, },{ ,,, },{ ,,, },{ ,,, } };
     Test("Test1", (int*)matrix, , , , false);
 }
 void Test7()
 {
     Test("Test1", nullptr, , , , false);
 }
 int main(int argc, char* argv[])
 {
     Test1();
     Test2();
     Test3();
     Test4();

     Test5();
     Test6();
     Test7();
     return ;
 }