Given a sequence of integers, as below:
| 5 | 3 | 2 | 7 | 1 | 9 | 6 |
Consider an algorithm that searches for an integer from left to right and scans the elements one by one. Assume you use this algorithm to find the element in the table. What kind of case is it, in terms of algorithm's performance?