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

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
• Simple answer I would say is that Appian is Turing Complete.  To prove it; do you want to try building a Turing Machine simulator?  That would be the tape with the symbols on it, and you can read symbols, store symbols, write symbols, and move the tape backwards and forwards.  If the Turing Machine works, then it can solve literally anything given enough time and RAM.

• Now we are talking! Then we could build the game of live in that turing machine which be itself is turing complete ... you made my day :-)

• 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".