It's been a while, but the Thursday code puzzlers are back! The idea is simple: solve the coding problem as efficiently as you can, in any language or framework that you think is suitable.
Note: Even though there really is nothing stopping you from finding a solution to this on the internet, try to keep honest, and come up with your own answer. It's all about the participation!
Taking a String as a parameter, list all the possible permuations of that string alphabetically.
There's a few different ways to achieve this. If you wish, you can express the efficiency of the algorithm you come up with using Big O notation.
Catch up on all our previous puzzlers here