News for hackers. Stuff that matters.
Re:On Secretly Terrible Engineers by Luyt on Sunday March 08, 2015 @06:17PM (#9167575)
Another way to do it, assuming that the list can be mutated: find the largest number in the array, store it somewhere and remove it from the list. Do this a second time. Then add those two numbers.

It evades sorting the array, but you have to search it twice.

    a = [7, 9, 2, 8]
    
    highest = max(a)
    a.remove(highest)

    nexthighest = max(a)
    a.remove(nexthighest)

    print highest + nexthighest    
Optimisation: just scan the array once, and keep track of the two highest numbers.

    a = [7, 9, 2, 8]

    highest = None
    nexthighest = None

    for item in a:
        if not highest or item > highest:
            highest = item
        elif not nexthighest or item > nexthighest:
            nexthighest = item

    print highest + nexthighest
Re:On Secretly Terrible Engineers by mden on Sunday March 08, 2015 @06:56PM (#9167748)
Fyi, there's a mistake in your second solution - consider a strictly increasing list.
Re:On Secretly Terrible Engineers by Luyt on Sunday March 08, 2015 @07:23PM (#9167842)
Thanks for the tip!

    a = [2, 7, 8, 9]

    highest = nexthighest = None

    for item in a:
        if not highest:
            highest = item
        elif item > highest:
            nexthighest = highest    
            highest = item
        elif not nexthighest:
            nexthighest = item
        elif item > nexthighest:
            nexthighest = item

    print highest + nexthighest