Search in a Row-Wise sorted matrix GFG POTD (23 DECEMBER 2024)

แชร์
ฝัง
  • เผยแพร่เมื่อ 5 ม.ค. 2025
  • ⭐ IN THE GIVEN PROBLEM WE NEED TO CHECK WEATHER THE VALUE X IS PRESENT OR NOT.
    ⭐ TIME COMPLEXITY: O(nLogn)
    ⭐ SPACE COMPLEXITY : O(1)
    NOTE: IT BETTER TO SOLVE IT USING BINARY SEARCH TO GET OPTIMAL RESULT, LINEAR SEARCH IS SOMEWHERE NOT FIT FOR THIS CONDITION...

ความคิดเห็น •