We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
it return the seqentially series of ascending order,,,but if the length of the two number is same return (i
if you compare two numbers
5000 and 60000
ovbiously length of 5000 is smaller than the others
so it returns the small length
and compare this two numbers
60000 and 60001
the two number length is same,,
but if u return only m<n
any of them can be print among them,,
but it is not correct.,,thats why u have to return
(i<j)that means though the lentgh same but it return greater number,
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Big Sorting
You are viewing a single comment's thread. Return to all comments →
it return the seqentially series of ascending order,,,but if the length of the two number is same return (i
if you compare two numbers 5000 and 60000
ovbiously length of 5000 is smaller than the others
so it returns the small length
and compare this two numbers