Given a square table , whose cells consist of integers:
| 5 | 1 | 4 | -1 | -4 |
| 11 | 6 | 4 | 2 | -2 |
| 9 | 7 | 1 | 0 | 10 |
| -8 | -1 | 11 | 7 | 0 |
| 0 | 21 | 13 | -3 | 3 |
Consider an algorithm that searches for an integer from the top left to the bottom right. Assume you use this algorithm to find the element in the table. What kind of case is it, in terms of algorithm's performance?