[10.9] Sorted Matrix Search 'naive' solution has O(N + M) complexity

In the solution to 10.9 task, the 'naive' solution is described as O(M log(N)), which isn't correct for the later algorithm. See example here: https://www.geeksforgeeks.org/search-element-sorted-matrix/