Matrix-Search-Efficient

package main

import (
    "fmt"
)

func main() {
// Example usage
    X := [][]int{
        {1, 2, 3},
        {4, 5, 6},
        {7, 8, 9},
    }
    k := 5
    result := find(X, k)
    if result[0] == -1 && result[1] == -1 {
        fmt.Println("Element not found.")
    } else {
        fmt.Printf("Element found at position (%d, %d).\n", result[0], result[1])
    }
}

func find(X [][]int, k int) [2]int {
    n := len(X)
    m := len(X[0])
    a := 0
    b := m - 1
    for a < n && b >= 0 {
        if X[a][b] == k {
            break
        } else if X[a][b] < k {
            a += 1
        } else {
            b -= 1
        }
    }
    if a >= n || b < 0 {
        return [2]int{-1, -1} // not found
    }
    return [2]int{a, b}
}