Get a list, sorted in increasing order by the last element in each tuple from a given list of non-empty tuples

Certified Associate Developer

Write a program to get a list, sorted in increasing order by the last element

in each tuple from a given list of non-empty tuples.

Input: [(1, 3), (3, 2), (2, 1)]


Output: [(2, 1), (3, 2), (1, 3)]

  Discussion posts and replies are publicly visible

Parents Reply
  • 0
    Certified Lead Developer
    in reply to Stefan Helzle

    Conway's game of life easy in Appian.  Only problem is that it only refreshes every 30 seconds, or you have to furiously mash a button over and over.  So it would be a very slow Conway's game of life.  But that proves Appian is Turing Complete, because it can simulate a Turing Machine, specifically Conway's Game of Life.

    Now, does it have a QUICK way to solve a particular problem?  Answer is generally "yes".

Children
No Data