Write a function which returns the maximum value in the array. Print the value returned. // 1.It reads a number N. // 2.Take Another N numbers as input and store them in an Array. // 3.calculate the ...

* Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n ...