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
  • 0
    Certified Lead Developer

    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.

Reply
  • 0
    Certified Lead Developer

    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.

Children