search

cognizance-amrita / hacktoberfest

An initiative to promote Hacktoberfest
MIT License
0 stars 35 forks source link

Create Findtherunnerupscore.cpp #75

Closed mohan-warrior closed 2 years ago

mohan-warrior commented 2 years ago

First take the input from user n i.e., size of an array. Take n elements of an array as input from user. Sort the array in ascending order. Take the last element of an array as max. Take the second last number as runner-up. again, for loop is used so that to check whether the max number is repeated or not.

ndrohith09 commented 2 years ago

@mohan-warrior roll back time conversion in python it has been done by @Yogiraj587 already.