Give a Big-Oh characterization, in terms of n, of the runnin
Give a Big-Oh characterization, in terms of n, of the running firm of the following algorithm. A is an array of integer values. Explain your answer. ()Algorithm Ex1(A) : for i <- 2 to length[A] Key <-