What is the time complexity of the following algorithm? [duplicate]

Answer 1

Total complexity is O(n*n).For method findMax (int[]a, int i) in worst case it will take complexity of O(n) ,because in worst case it will search for 0 to last element as Max element present in last.