HP49-HP50 : when {list of repeated solutions} —> {list with no rep. sol}

[David Hayden]

Here's another solution using SORT and STREAM. You have to use it after converting the list items to strings because you can't sort a list of arrays. This should be faster O(n*log(n)) than Werner's (O(n²))when the input is large.

Half the code is devoted to converting the results from individual items on the stack back into a list. Maybe there's an easier way that's still fast.

Code:

« DEPTH  → D
  «
  SORT
  « DUP2 IF == THEN DROP END »
  STREAM
  DEPTH D - 1. + →LIST
  »
»