Search for 5 in sorted row-wise matrix and print found/not found.
Ready — edit the code above and click Run.
using System;
class Program
{
static void Main()
{
int[,] m = { {1,3,5}, {7,9,11}, {13,15,17} };
int target = 5;
bool found = false;
for (int i = 0; i < m.GetLength(0) && !found; i++)
for (int j = 0; j < m.GetLength(1); j++)
if (m[i,j] == target) found = true;
Console.WriteLine(found ? "Found" : "Not Found");
}
}
Try solving on your own first, then reveal the official answer.
Brute force O(rows×cols). Optimized: start top-right and eliminate row/col (staircase search).