What is the runtime performance of the following algorithm in Big-O? Hint: Assume
N
is the length of array.O(N^2)O(log N)O(1)O(N)