在排序矩阵中搜索元素

给定一个排序矩阵 mat[n][m] 和一个元素 ‘x’。如果 x 存在，则查找矩阵中 x 的位置，否则打印 -1。矩阵的排序方式是，一行中的所有元素都按升序排序，对于行 ‘i’，其中 1 <= i <= n-1，行 ‘i’ 的第一个元素大于或等于’i-1′ 行的最后一个元素。该方法应该具有 O(log n + log m) 时间复杂度。

例子：

Input : mat[][] = { {1, 5, 9},
                    {14, 20, 21},
                    {30, 34, 43} }
        x = 14
Output : Found at (1, 0)

Input : mat[][] = { {1, 5, 9, 11},
                    {14, 20, 21, 26},
                    {30, 34, 43, 50} }
        x = 42
Output : -1

请注意，此问题与按行和列排序矩阵中的搜索不同。这里的矩阵排序更严格，因为一行的第一个元素大于前一行的最后一个元素。

一个简单的解决方案是将 x 与矩阵的每个元素一一比较。如果匹配，则返回位置。如果我们到达终点，则返回 -1。该解决方案的时间复杂度为 O(nxm)。

一个有效的解决方案是将给定的二维数组类型转换为一维数组，然后对类型转换的数组应用二分搜索。

下面解释了另一种不需要类型转换的有效方法。

1) Perform binary search on the middle column 
   till only two elements are left or till the
   middle element of some row in the search is
   the required element 'x'. This search is done
   to skip the rows that are not required
2) The two left elements must be adjacent. Consider
   the rows of two elements and do following
   a) check whether the element 'x' equals to the 
      middle element of any one of the 2 rows
   b) otherwise according to the value of the 
      element 'x' check whether it is present in 
      the 1st half of 1st row, 2nd half of 1st row, 
      1st half of 2nd row or 2nd half of 2nd row. 

Note: This approach works for the matrix n x m 
      where 2 <= n. The algorithm can be modified
      for matrix 1 x m, we just need to check whether
      2nd row exists or not      

例子：

Consider:    | 1  2  3  4| 
x = 3, mat = | 5  6  7  8|   Middle column:
             | 9 10 11 12|    = {2, 6, 10, 14}
             |13 14 15 16|   perform binary search on them
                             since, x < 6, discard the 
                             last 2 rows as 'a' will 
                             not lie in them(sorted matrix)
Now, only two rows are left
             | 1  2  3  4| 
x = 3, mat = | 5  6  7  8|   Check whether element is present
                             on the middle elements of these
                             rows = {2, 6}
                             x != 2 or 6
If not, consider the four sub-parts
1st half of 1st row = {1}, 2nd half of 1st row = {3, 4}
1st half of 2nd row = {5}, 2nd half of 2nd row = {7, 8}

According the value of 'x' it will be searched in the
2nd half of 1st row = {3, 4} and found at (i, j): (0, 2)                              

C++

// C++ implementation to search an element in a
// sorted matrix
#include 
using namespace std;
 
const int MAX = 100;
 
// This function does Binary search for x in i-th
// row. It does the search from mat[i][j_low] to
// mat[i][j_high]
void binarySearch(int mat[][MAX], int i, int j_low,
                                int j_high, int x)
{
    while (j_low <= j_high)
    {
        int j_mid = (j_low + j_high) / 2;
 
        // Element found
        if (mat[i][j_mid] == x)
        {
            cout << "Found at (" << i << ", "
                 << j_mid << ")";
            return;
        }
 
        else if (mat[i][j_mid] > x)
            j_high = j_mid - 1;
 
        else
            j_low = j_mid + 1;
    }
 
    // element not found
    cout << "Element no found";
}
 
// Function to perform binary search on the mid
// values of row to get the desired pair of rows
// where the element can be found
void sortedMatrixSearch(int mat[][MAX], int n,
                                  int m, int x)
{
    // Single row matrix
    if (n == 1)
    {
        binarySearch(mat, 0, 0, m-1, x);
        return;
    }
 
    // Do binary search in middle column.
    // Condition to terminate the loop when the
    // 2 desired rows are found
    int i_low = 0;
    int i_high = n-1;
    int j_mid = m/2;
    while ((i_low+1) < i_high)
    {
        int i_mid = (i_low + i_high) / 2;
 
        // element found
        if (mat[i_mid][j_mid] == x)
        {
            cout << "Found at (" << i_mid << ", "
                 << j_mid << ")";
            return;
        }
 
        else if (mat[i_mid][j_mid] > x)
            i_high = i_mid;
 
        else
            i_low = i_mid;
    }
 
    // If element is present on the mid of the
    // two rows
    if (mat[i_low][j_mid] == x)
        cout << "Found at (" << i_low << ","
             << j_mid << ")";
    else if (mat[i_low+1][j_mid] == x)
        cout << "Found at (" << (i_low+1)
             << ", " << j_mid << ")";
 
    // Ssearch element on 1st half of 1st row
    else if (x <= mat[i_low][j_mid-1])
        binarySearch(mat, i_low, 0, j_mid-1, x);
 
    // Search element on 2nd half of 1st row
    else if (x >= mat[i_low][j_mid+1]  &&
             x <= mat[i_low][m-1])
       binarySearch(mat, i_low, j_mid+1, m-1, x);
 
    // Search element on 1st half of 2nd row
    else if (x <= mat[i_low+1][j_mid-1])
        binarySearch(mat, i_low+1, 0, j_mid-1, x);
 
    // search element on 2nd half of 2nd row
    else
        binarySearch(mat, i_low+1, j_mid+1, m-1, x);
}
 
// Driver program to test above
int main()
{
    int n = 4, m = 5, x = 8;
    int mat[][MAX] = {{0, 6, 8, 9, 11},
                     {20, 22, 28, 29, 31},
                     {36, 38, 50, 61, 63},
                     {64, 66, 100, 122, 128}};
 
    sortedMatrixSearch(mat, n, m, x);
    return 0;
}

Java

// java implementation to search
// an element in a sorted matrix
import java.io.*;
 
class GFG
{
    static int MAX = 100;
     
    // This function does Binary search for x in i-th
    // row. It does the search from mat[i][j_low] to
    // mat[i][j_high]
    static void binarySearch(int mat[][], int i, int j_low,
                                    int j_high, int x)
    {
        while (j_low <= j_high)
        {
            int j_mid = (j_low + j_high) / 2;
     
            // Element found
            if (mat[i][j_mid] == x)
            {
                System.out.println ( "Found at (" + i
                                     + ", " + j_mid +")");
                return;
            }
     
            else if (mat[i][j_mid] > x)
                j_high = j_mid - 1;
     
            else
                j_low = j_mid + 1;
        }
     
        // element not found
        System.out.println ( "Element no found");
    }
     
    // Function to perform binary search on the mid
    // values of row to get the desired pair of rows
    // where the element can be found
    static void sortedMatrixSearch(int mat[][], int n,
                                         int m, int x)
    {
        // Single row matrix
        if (n == 1)
        {
            binarySearch(mat, 0, 0, m - 1, x);
            return;
        }
     
        // Do binary search in middle column.
        // Condition to terminate the loop when the
        // 2 desired rows are found
        int i_low = 0;
        int i_high = n - 1;
        int j_mid = m / 2;
        while ((i_low + 1) < i_high)
        {
            int i_mid = (i_low + i_high) / 2;
     
            // element found
            if (mat[i_mid][j_mid] == x)
            {
                System.out.println ( "Found at (" + i_mid +", "
                                    + j_mid +")");
                return;
            }
     
            else if (mat[i_mid][j_mid] > x)
                i_high = i_mid;
     
            else
                i_low = i_mid;
        }
     
        // If element is present on
        // the mid of the two rows
        if (mat[i_low][j_mid] == x)
            System.out.println ( "Found at (" + i_low + ","
                                 + j_mid +")");
        else if (mat[i_low + 1][j_mid] == x)
            System.out.println ( "Found at (" + (i_low + 1)
                                + ", " + j_mid +")");
     
        // Ssearch element on 1st half of 1st row
        else if (x <= mat[i_low][j_mid - 1])
            binarySearch(mat, i_low, 0, j_mid - 1, x);
     
        // Search element on 2nd half of 1st row
        else if (x >= mat[i_low][j_mid + 1] &&
                 x <= mat[i_low][m - 1])
        binarySearch(mat, i_low, j_mid + 1, m - 1, x);
     
        // Search element on 1st half of 2nd row
        else if (x <= mat[i_low + 1][j_mid - 1])
            binarySearch(mat, i_low + 1, 0, j_mid - 1, x);
     
        // search element on 2nd half of 2nd row
        else
            binarySearch(mat, i_low + 1, j_mid + 1, m - 1, x);
    }
     
    // Driver program
    public static void main (String[] args)
    {
        int n = 4, m = 5, x = 8;
        int mat[][] = {{0, 6, 8, 9, 11},
                       {20, 22, 28, 29, 31},
                       {36, 38, 50, 61, 63},
                       {64, 66, 100, 122, 128}};
     
        sortedMatrixSearch(mat, n, m, x);
         
    }
}
 
// This code is contributed by vt_m

Python3

# Python3 implementation
# to search an element in a
# sorted matrix
MAX = 100
 
# This function does Binary
# search for x in i-th
# row. It does the search
# from mat[i][j_low] to
# mat[i][j_high]
def binarySearch(mat, i, j_low,
                 j_high, x):
 
    while (j_low <= j_high):
     
        j_mid = (j_low + j_high) // 2
 
        # Element found
        if (mat[i][j_mid] == x):
         
            print("Found at (", i, ", ", j_mid, ")")
            return
 
        elif (mat[i][j_mid] > x):
            j_high = j_mid - 1
 
        else:
            j_low = j_mid + 1
    
    # Element not found
    print ("Element no found")
 
# Function to perform binary
# search on the mid values of
# row to get the desired pair of rows
# where the element can be found
def sortedMatrixSearch(mat, n, m, x):
 
    # Single row matrix
    if (n == 1):
     
        binarySearch(mat, 0, 0, m - 1, x)
        return
 
    # Do binary search in middle column.
    # Condition to terminate the loop
    # when the 2 desired rows are found
    i_low = 0
    i_high = n - 1
    j_mid = m // 2
    while ((i_low + 1) < i_high):
     
        i_mid = (i_low + i_high) // 2
 
        # element found
        if (mat[i_mid][j_mid] == x):
         
            print ("Found at (", i_mid, ", ", j_mid, ")")
            return
 
        elif (mat[i_mid][j_mid] > x):
            i_high = i_mid
 
        else:
            i_low = i_mid
 
    # If element is present on the mid of the
    # two rows
    if (mat[i_low][j_mid] == x):
        print ("Found at (" , i_low, ",", j_mid , ")")
    elif (mat[i_low + 1][j_mid] == x):
        print ("Found at (", (i_low + 1), ", ", j_mid, ")")
 
    # Ssearch element on 1st half of 1st row
    elif (x <= mat[i_low][j_mid - 1]):
        binarySearch(mat, i_low, 0, j_mid - 1, x)
 
    # Search element on 2nd half of 1st row
    elif (x >= mat[i_low][j_mid + 1] and
          x <= mat[i_low][m - 1]):
       binarySearch(mat, i_low, j_mid + 1, m - 1, x)
 
    # Search element on 1st half of 2nd row
    elif (x <= mat[i_low + 1][j_mid - 1]):
        binarySearch(mat, i_low + 1, 0, j_mid - 1, x)
  
    # Search element on 2nd half of 2nd row
    else:
        binarySearch(mat, i_low + 1, j_mid + 1, m - 1, x)
 
# Driver program to test above
if __name__ == "__main__":
 
    n = 4
    m = 5
    x = 8
    mat = [[0, 6, 8, 9, 11],
           [20, 22, 28, 29, 31],
           [36, 38, 50, 61, 63],
           [64, 66, 100, 122, 128]]
    sortedMatrixSearch(mat, n, m, x)
    
# This code is contributed by Chitranayal

C#

// C# implementation to search
// an element in a sorted matrix
using System;
 
class GFG
{
    // This function does Binary search for x in i-th
    // row. It does the search from mat[i][j_low] to
    // mat[i][j_high]
    static void binarySearch(int [,]mat, int i, int j_low,
                                        int j_high, int x)
    {
        while (j_low <= j_high)
        {
            int j_mid = (j_low + j_high) / 2;
     
            // Element found
            if (mat[i,j_mid] == x)
            {
                Console.Write ( "Found at (" + i +
                                ", " + j_mid +")");
                return;
            }
     
            else if (mat[i,j_mid] > x)
                j_high = j_mid - 1;
     
            else
                j_low = j_mid + 1;
        }
     
        // element not found
        Console.Write ( "Element no found");
    }
     
    // Function to perform binary search on the mid
    // values of row to get the desired pair of rows
    // where the element can be found
    static void sortedMatrixSearch(int [,]mat, int n,
                                        int m, int x)
    {
        // Single row matrix
        if (n == 1)
        {
            binarySearch(mat, 0, 0, m - 1, x);
            return;
        }
     
        // Do binary search in middle column.
        // Condition to terminate the loop when the
        // 2 desired rows are found
        int i_low = 0;
        int i_high = n - 1;
        int j_mid = m / 2;
        while ((i_low + 1) < i_high)
        {
            int i_mid = (i_low + i_high) / 2;
     
            // element found
            if (mat[i_mid,j_mid] == x)
            {
                 
                Console.Write ( "Found at (" + i_mid +
                                ", "    + j_mid +")");
                return;
            }
     
            else if (mat[i_mid,j_mid] > x)
                i_high = i_mid;
     
            else
                i_low = i_mid;
        }
     
        // If element is present on
        // the mid of the two rows
        if (mat[i_low,j_mid] == x)
        Console.Write ( "Found at (" + i_low +
                           "," + j_mid +")");
        else if (mat[i_low + 1,j_mid] == x)
        Console.Write ( "Found at (" + (i_low
                   + 1) + ", " + j_mid +")");
     
        // Ssearch element on 1st half of 1st row
        else if (x <= mat[i_low,j_mid - 1])
            binarySearch(mat, i_low, 0, j_mid - 1, x);
     
        // Search element on 2nd half of 1st row
        else if (x >= mat[i_low,j_mid + 1] &&
                 x <= mat[i_low,m - 1])
        binarySearch(mat, i_low, j_mid + 1, m - 1, x);
     
        // Search element on 1st half of 2nd row
        else if (x <= mat[i_low + 1,j_mid - 1])
            binarySearch(mat, i_low + 1, 0, j_mid - 1, x);
     
        // search element on 2nd half of 2nd row
        else
            binarySearch(mat, i_low + 1, j_mid + 1, m - 1, x);
    }
     
    // Driver program
    public static void Main (String[] args)
    {
        int n = 4, m = 5, x = 8;
        int [,]mat = {{0, 6, 8, 9, 11},
                    {20, 22, 28, 29, 31},
                    {36, 38, 50, 61, 63},
                    {64, 66, 100, 122, 128}};
     
        sortedMatrixSearch(mat, n, m, x);
    }
}
 
// This code is contributed by parashar...

Javascript

 
// Javascript implementation to search
// an element in a sorted matrix
let MAX = 100;
 
// This function does Binary search for x in i-th
// row. It does the search from mat[i][j_low] to
// mat[i][j_high]
function binarySearch(mat, i, j_low, j_high, x)
{
    while (j_low <= j_high)
    {
        let j_mid = Math.floor((j_low + j_high) / 2);
  
        // Element found
        if (mat[i][j_mid] == x)
        {
            document.write("Found at (" + i + ", " +
                           j_mid +")");
            return;
        }
  
        else if (mat[i][j_mid] > x)
            j_high = j_mid - 1;
  
        else
            j_low = j_mid + 1;
    }
     
    // Element not found
    document.write( "Element no found<br>");
}
 
// Function to perform binary search on the mid
// values of row to get the desired pair of rows
// where the element can be found
function sortedMatrixSearch(mat, n, m, x)
{
     
    // Single row matrix
    if (n == 1)
    {
        binarySearch(mat, 0, 0, m - 1, x);
        return;
    }
  
    // Do binary search in middle column.
    // Condition to terminate the loop when the
    // 2 desired rows are found
    let i_low = 0;
    let i_high = n - 1;
    let j_mid = Math.floor(m / 2);
     
    while ((i_low + 1) < i_high)
    {
        let i_mid = Math.floor((i_low + i_high) / 2);
  
        // Element found
        if (mat[i_mid][j_mid] == x)
        {
            document.write("Found at (" + i_mid +
                           ", " + j_mid +")");
            return;
        }
  
        else if (mat[i_mid][j_mid] > x)
            i_high = i_mid;
        else
            i_low = i_mid;
    }
  
    // If element is present on
    // the mid of the two rows
    if (mat[i_low][j_mid] == x)
        document.write("Found at (" + i_low +
                       "," + j_mid +")");
    else if (mat[i_low + 1][j_mid] == x)
        document.write("Found at (" + (i_low + 1) +
                       ", " + j_mid +")");
  
    // Search element on 1st half of 1st row
    else if (x <= mat[i_low][j_mid - 1])
        binarySearch(mat, i_low, 0, j_mid - 1, x);
  
    // Search element on 2nd half of 1st row
    else if (x >= mat[i_low][j_mid + 1] &&
             x <= mat[i_low][m - 1])
        binarySearch(mat, i_low, j_mid + 1,
                                     m - 1, x);
  
    // Search element on 1st half of 2nd row
    else if (x <= mat[i_low + 1][j_mid - 1])
        binarySearch(mat, i_low + 1, 0,
                          j_mid - 1, x);
  
    // search element on 2nd half of 2nd row
    else
        binarySearch(mat, i_low + 1, j_mid + 1,
                              m - 1, x);
}
 
// Driver code
let n = 4, m = 5, x = 8;
let mat = [ [ 0, 6, 8, 9, 11 ],
            [ 20, 22, 28, 29, 31 ],
            [ 36, 38, 50, 61, 63 ],
            [ 64, 66, 100, 122, 128 ] ];
             
sortedMatrixSearch(mat, n, m, x);
 
// This code is contributed by ab2127
 

输出

Found at (0,2)

时间复杂度：O(log n + log m)。需要 O(Log n) 时间来找到所需的两行。那么在大小等于 m/2 的四个部分之一中进行二分搜索需要 O(Log m) 时间。

此方法由Ayush Jauhari贡献。

方法二：使用二维二分查找

这种方法也具有相同的时间复杂度：O(log(m) + log(n)) 和辅助空间：O(1)，但算法要容易得多，代码方式更易于理解。

方法：我们可以观察到，我们想要找到的任何数字(比如 k)都必须存在于一行中，包括该行的第一个和最后一个元素(如果它存在的话)。因此，我们首先使用二分搜索( O(logn) )找到 k 所在的行，然后再次使用二分搜索在该行中搜索( O(logm) )。

算法：

1) 首先我们会找到正确的行，其中 k=2 可能存在。为此，我们将同时对第一列和最后一列应用二分搜索。

    low=0, high=n-1

     i) if( k< first element of row(a[mid][0]) ) => k must exist in the row above

                                              => high=mid-1;

                                                    

     ii) if( k> last element of row(a[mid][m-1])) => k must exist in the row above

                                               => low=mid+1; 

                                                  

     iii) if( k> first element of row(a[mid][0]) &&  k< last element of row(a[mid][m-1]))

                                               => k must exist in this row

                                               => apply binary search in this row like in a 1-D array

     iv) i) if( k== first element of row(a[mid][0]) ||  k== last element of row(a[mid][m-1])) => found                                       

Example:
let k=2; n=3,m=4;
    matrix a: [0, 1, 2, 3 ]
              [10,11,12,13]
              [20,21,22,23]

1) low=0, high=n-1(=2) => mid=1 //check 1st row     [0....3]
                                                 -->[10...13]<-- 
                                                    [20...23]                                                        
   k < a[mid][0] => high = mid-1;(=1)
2) low=0, high=1; =>mid=0; //check 0th row    -->[0...3]<--  
    k>a[mid][0] && k k must exist in this row
    
    now simply apply binary search in 1-D array: [0,1,2,3]                              

下面是上述算法的Java实现：

Java

// Java program for the above approach
import java.util.*;
public class Main {
 
    static void findRow(int[][] a, int n, int m, int k)
    {
        int l = 0, r = n - 1, mid;
 
        while (l <= r) {
            mid = (l + r) / 2;
 
            // we'll check the left and
            // right most elements
            // of the row here itself
            // for efficiency
            if (k == a[mid][0]) // checking leftmost element
            {
                System.out.println("Found at (" + mid + ","
                                   + "0)");
                return;
            }
 
            if (k == a[mid][m - 1]) // checking rightmost
                                    // element
            {
                int t = m - 1;
                System.out.println("Found at (" + mid + ","
                                   + t + ")");
                return;
            }
 
            if (k > a[mid][0]
                && k < a[mid]
                        [m - 1]) // this means the element
                                 // must be within this row
            {
                binarySearch(a, n, m, k,
                             mid); // we'll apply binary
                                   // search on this row
                return;
            }
 
            if (k < a[mid][0])
                r = mid - 1;
            if (k > a[mid][m - 1])
                l = mid + 1;
        }
    }
 
    static void binarySearch(int[][] a, int n, int m, int k,
                             int x) // x is the row number
    {
        // now we simply have to apply binary search as we
        // did in a 1-D array, for the elements in row
        // number
        // x
 
        int l = 0, r = m - 1, mid;
        while (l <= r) {
            mid = (l + r) / 2;
 
            if (a[x][mid] == k) {
                System.out.println("Found at (" + x + ","
                                   + mid + ")");
                return;
            }
 
            if (a[x][mid] > k)
                r = mid - 1;
            if (a[x][mid] < k)
                l = mid + 1;
        }
        System.out.println("Element not found");
    }
   
    // Driver Code
    public static void main(String args[])
    {
        int n = 4; // no. of rows
        int m = 5; // no. of columns
 
        int a[][] = { { 0, 6, 8, 9, 11 },
                      { 20, 22, 28, 29, 31 },
                      { 36, 38, 50, 61, 63 },
                      { 64, 66, 100, 122, 128 } };
 
        int k = 31; // element to search
 
        findRow(a, n, m, k);
    }
}

蟒蛇3

# Python program for the above approach
def findRow(a, n, m, k):
    l = 0
    r = n - 1
    mid = 0
    while (l <= r) :
        mid = int((l + r) / 2)
         
        # we'll check the left and
        # right most elements
        # of the row here itself
        # for efficiency
        if(k == a[mid][0]): #checking leftmost element
            print("Found at (" , mid , ",", "0)", sep = "")
            return
         
        if(k == a[mid][m - 1]): # checking rightmost element
            t = m - 1
            print("Found at (" , mid , ",", t , ")", sep = "")
            return
        if(k > a[mid][0] and k < a[mid][m - 1]):    # this means the element
                                                    # must be within this row
            binarySearch(a, n, m, k, mid)    # we'll apply binary
                                            # search on this row
            return
        if (k < a[mid][0]):
            r = mid - 1
        if (k > a[mid][m - 1]):
            l = mid + 1
 
def binarySearch(a, n, m, k, x):    #x is the row number
     
    # now we simply have to apply binary search as we
    # did in a 1-D array, for the elements in row
    # number
    # x
    l = 0
    r = m - 1
    mid = 0
    while (l <= r):
        mid = int((l + r) / 2)
         
        if (a[x][mid] == k):
            print("Found at (" , x , ",", mid , ")", sep = "")
            return
        if (a[x][mid] > k):
            r = mid - 1
        if (a[x][mid] < k):
            l = mid + 1
     
    print("Element not found")
 
# Driver Code
n = 4 # no. of rows
m = 5 # no. of columns
a = [[ 0, 6, 8, 9, 11], [20, 22, 28, 29, 31], [36, 38, 50, 61, 63 ], [64, 66, 100, 122, 128]]
k = 31  # element to search
findRow(a, n, m, k)
 
# This code is contributed by avanitrachhadiya2155

C＃

// C# program for the above approach
using System;
public class GFG
{
 
  static void findRow(int[,] a, int n, int m, int k)
  {
    int l = 0, r = n - 1, mid;
 
    while (l <= r) {
      mid = (l + r) / 2;
 
      // we'll check the left and
      // right most elements
      // of the row here itself
      // for efficiency
      if (k == a[mid,0]) // checking leftmost element
      {
        Console.WriteLine("Found at (" + mid + ","
                          + "0)");
        return;
      }
 
      if (k == a[mid,m - 1]) // checking rightmost
        // element
      {
        int t = m - 1;
        Console.WriteLine("Found at (" + mid + ","
                          + t + ")");
        return;
      }
 
      if (k > a[mid,0]
          && k < a[mid,m - 1]) // this means the element
        // must be within this row
      {
        binarySearch(a, n, m, k,
                     mid); // we'll apply binary
        // search on this row
        return;
      }
 
      if (k < a[mid,0])
        r = mid - 1;
      if (k > a[mid,m - 1])
        l = mid + 1;
    }
  }
 
  static void binarySearch(int[,] a, int n, int m, int k,
                           int x) // x is the row number
  {
    // now we simply have to apply binary search as we
    // did in a 1-D array, for the elements in row
    // number
    // x
 
    int l = 0, r = m - 1, mid;
    while (l <= r) {
      mid = (l + r) / 2;
 
      if (a[x,mid] == k) {
        Console.WriteLine("Found at (" + x + ","
                          + mid + ")");
        return;
      }
 
      if (a[x,mid] > k)
        r = mid - 1;
      if (a[x,mid] < k)
        l = mid + 1;
    }
    Console.WriteLine("Element not found");
  }
 
  // Driver Code
  static public void Main ()
  {
    int n = 4; // no. of rows
    int m = 5; // no. of columns
 
    int[,] a = { { 0, 6, 8, 9, 11 },
                { 20, 22, 28, 29, 31 },
                { 36, 38, 50, 61, 63 },
                { 64, 66, 100, 122, 128 } };
 
    int k = 31; // element to search
 
    findRow(a, n, m, k);
  }
}
 
// This code is contributed by rag2127

C++

//C++ program for above approach
#include 
using namespace std;
 
const int MAX = 100;
 
void binarySearch(int a[][MAX], int n, int m, int k, int x)
// x is the row number
{
    // now we simply have to apply binary search as we
    // did in a 1-D array, for the elements in row
    // number
    // x
 
    int l = 0, r = m - 1, mid;
    while (l <= r)
    {
        mid = (l + r) / 2;
 
        if (a[x][mid] == k)
        {
            cout << "Found at (" << x << "," << mid << ")" << endl;
            return;
        }
 
        if (a[x][mid] > k)
            r = mid - 1;
        if (a[x][mid] < k)
            l = mid + 1;
    }
    cout << "Element not found" << endl;
}
 
void findRow(int a[][MAX], int n, int m, int k)
{
 
    int l = 0, r = n - 1, mid;
 
    while (l <= r)
    {
        mid = (l + r) / 2;
 
        // we'll check the left and
        // right most elements
        // of the row here itself
        // for efficiency
        if (k == a[mid][0]) // checking leftmost element
        {
            cout << "Found at (" << mid << ",0)" << endl;
            return;
        }
 
        if (k == a[mid][m - 1]) // checking rightmost
                                // element
        {
            int t = m - 1;
            cout << "Found at (" << mid << "," << t << ")" << endl;
            return;
        }
 
        if (k > a[mid][0] && k < a[mid][m - 1])
        // this means the element
        // must be within this row
        {
            binarySearch(a, n, m, k, mid);
            // we'll apply binary
            // search on this row
            return;
        }
 
        if (k < a[mid][0])
            r = mid - 1;
        if (k > a[mid][m - 1])
            l = mid + 1;
    }
}
 
//Driver Code
int main()
{
    int n = 4; // no. of rows
    int m = 5; // no. of columns
 
    int a[][MAX] = {{0, 6, 8, 9, 11},
                    {20, 22, 28, 29, 31},
                    {36, 38, 50, 61, 63},
                    {64, 66, 100, 122, 128}};
 
    int k = 31; // element to search
 
 
    findRow(a, n, m, k);
     
    return 0;
}
// This code is contributed by nirajgusain5

Javascript

 
// JavaScript program for above approach
var MAX = 100;
 
function binarySearch(a, n, m, k, x)
// x is the row number
{
    // now we simply have to apply binary search as we
    // did in a 1-D array, for the elements in row
    // number
    // x
 
    var l = 0, r = m - 1, mid;
    while (l <= r)
    {
        mid = (l + r) / 2;
 
        if (a[x][mid] == k)
        {
            document.write( "Found at (" + x + "," + mid + ")<br>");
            return;
        }
 
        if (a[x][mid] > k)
            r = mid - 1;
        if (a[x][mid] < k)
            l = mid + 1;
    }
    document.write( "Element not found<br>");
}
 
function findRow(a, n, m, k)
{
 
    var l = 0, r = n - 1, mid;
 
    while (l <= r)
    {
        mid = parseInt((l + r) / 2);
 
        // we'll check the left and
        // right most elements
        // of the row here itself
        // for efficiency
        if (k == a[mid][0]) // checking leftmost element
        {
            document.write( "Found at (" + mid + ",0)<br>");
            return;
        }
 
        if (k == a[mid][m - 1]) // checking rightmost
                                // element
        {
            var t = m - 1;
            document.write( "Found at (" + mid + "," + t + ")<br>");
            return;
        }
 
        if (k > a[mid][0] && k < a[mid][m - 1])
        // this means the element
        // must be within this row
        {
            binarySearch(a, n, m, k, mid);
            // we'll apply binary
            // search on this row
            return;
        }
 
        if (k < a[mid][0])
            r = mid - 1;
        if (k > a[mid][m - 1])
            l = mid + 1;
    }
}
 
//Driver Code
var n = 4; // no. of rows
var m = 5; // no. of columns
var a = [[0, 6, 8, 9, 11],
                [20, 22, 28, 29, 31],
                [36, 38, 50, 61, 63],
                [64, 66, 100, 122, 128]];
var k = 31; // element to search
findRow(a, n, m, k);
 

输出

Found at (1,4)

如果您希望与专家一起参加现场课程，请参阅DSA 现场工作专业课程和学生竞争性编程现场课程。