Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,851 questions

51,772 answers

573 users

How to search a 2d matrix using binary search in C

1 Answer

0 votes
#include <stdio.h>
#include <stdbool.h>

#define ROWS 3
#define COLS 4

bool searchMatrix(int matrix[][COLS], int rows, int cols, int target) {
    int start = 0;
    int end = rows * cols - 1;

    while (start <= end) {
        int mid = start + (end - start) / 2;

        // Map the 1D index to 2D indices
        int midValue = matrix[mid / cols][mid % cols];

        if (midValue == target) {
            return true; // Target found
        } else if (midValue < target) {
            start = mid + 1; // Search in the right half
        } else {
            end = mid - 1; // Search in the left half
        }
    }

    return false; // Target not found
}

int main() {
    int matrix[ROWS][COLS] = {
        { 1,  4,  6,  9},
        {11, 17, 18, 29},
        {32, 38, 40, 70}
    };

    int target = 17;

    if (searchMatrix(matrix, ROWS, COLS, target)) {
        printf("Target %d found in the matrix.\n", target);
    } else {
        printf("Target %d not found in the matrix.\n", target);
    }

    return 0;
}



/*
run:

Target 17 found in the matrix.

*/

 



answered Sep 22, 2025 by avibootz
...