need to find the Big O complexites of the psudocode. I believe it is a O(n) complexity.

myFunction(numbers, numbersSize, key) { for (i = 0; i < numbersSize; ++i) { if (numbers[i] == key) { return i } } return -1 }