Re:On Secretly Terrible Engineers
by codygman on Sunday March 08, 2015 @05:57PM
(#9167472)
Ha, that's basically what I just did with the Haskell version:
[ Parent
| on HN ]
I can do that in Python ;-)
a = [7, 9, 2, 8]
print sum(sorted(a)[-2:])Oh cool, slices don't return index errors:
>>> print sum(sorted([])[-2:])
0Reading the original problem, "Write a function that returns the sum of the two largest numbers in an array", I took the liberty of assuming that the input list would always contain at least two items.