One-Line Sort Algorithms #64
Labels
enhancement
New feature or request
hacktoberfest-accepted
Hacktoberfest!
help wanted
Extra attention is needed
question
Further information is requested
suggestion
Suggest changes to this repository
This was first demonstrated in #5 (1 line quicksort in haskell) but are other sorting algorithms (ie merge, bubble, heap, bucket, radix, selection, etc) also possible in "one line" (in any language)? If not "one line", what's the shortest you think you can make it? I think this would be a cool task for people to try and complete.
The text was updated successfully, but these errors were encountered: