Thx.

i should equal 1, there is no reason to compare arr[0] to itself.

O(nlogn)

Just wanted to fix the tests and try this kumite thing oout ;)

It goes to minus infinity, math logarithmic expressions look if you want

If you want to use totally inefficient approach, then yes, you can.

you can also do it like ;

findMax = a => a.sort((x, y) => x - y ).pop()

thanks

What if numners are all negative