Description

This pull request adds theSearch a 2D Matrix algorithm to the directory
src/main/java/com/thealgorithms/matrix/.

This algorithm solves the well-known problem where each row of the matrix is sorted,
and the first element of each row is greater than the last element of the previous row.
A binary search is applied on the virtual 1D representation of the matrix to achieve
O(log(m*n)) time complexity.

A detailed explanation of the problem can be found here:
https://leetcode.com/problems/search-a-2d-matrix/

This implementation includes:

• Clean binary search logic
• JavaDoc-style documentation
• Proper placement within thematrix package

Type of Change

• New Algorithm (non-breaking addition)
• Enhancement to the matrix category

Checklist

• I have readCONTRIBUTING.md.
• This pull request is all my own work.
• File name follows PascalCase.
• Function and variable names follow Java coding conventions.
• Added the required URL reference in the JavaDoc comment.
• Code is formatted withclang-format as required.