# Tag Info

Accepted

### Lossy Sorting (Implement Dropsort)

APL, 9 bytes ⊢(/⍨)⊢=⌈\ This is a monadic function train with diagram: ┌─┼───┐ ⊢ ⍨ ┌─┼─┐ ┌─┘ ⊢ = \ / ┌─┘ ⌈ The ...

### Sort the months of the year

Jelly, 19 bytes 11ị“bMAanlseovc”iµÞ This is a monadic link that takes a list as argument and sorts it. Try it online! Background Jelly uses modular, 1-based ...

### Vertically collapse text

Haskell, 62 bytes import Data.List p=reverse;o=transpose f=unlines.p.o.o.p.lines I'm very mature.

### Output numbers up to 2^n-1, "sorted"

Python, 53 bytes f=lambda n,i=1:n*[f]and[i]+f(n-1,2*i)+i%2*f(n-1,i-~i) Try it online! The recursive function generates the sorted list as a pre-order walk down ...

### Xorting an array

Pyth, 40 36 31 30 bytes Ju.|G^2slHxMf>FT.:Q2Z|tSIxRJQJ Try it online: Demonstration or Test Suite Each of the big test-cases finishes in a couple of seconds. ...
Accepted

### Find the longest word in an array

Imperative Tampio, 168 bytes ...
Accepted

### Count My Change

Japt, 5 3 bytes ñg9 Test it online! Explanation I, too, have added a sorting function to my language in the last few weeks :-) ...

### Sort a list and write some English!

Python 2 & 3 Unfortunately, the employees of today just can't stop using hashtags all over the place... ...

### Sign that word!

C (with x86), 61 bytes s[];main(){qsort(s,read(0,s,99),1,"YXZQQQ\x8a\x00*\x02\x0f\xbe\xc0\xc3");puts(s);} That string contains raw bytes, not actual ...
Accepted

Python 2, 58 54 bytes lambda x:sorted(x,key=lambda y,B10=0:eval(y[1:]+'10')) Try it online! How it works ...

### DropSort it like it's hot

Haskell, 67 59 58 bytes (q:r)!x|x<last q=q:r!x|1<2=(q++[x]):r _!x=[[x]] foldl(!)[] Explanation: Given a list of lists (that are already sorted) and a value ...

### Sort a list and write some English!

Dogescript It's basically English, right? shh oooot! my keyybr oad is brokn. i ne ed neew 1. such fixs much keys keys dose sort wow keys translates to: ...
Accepted

### Sort an Integer List

05AB1E, 2 bytes Code: œß Same algorithm as the Jelly answer. Computes all permutations of the input and pops out the smallest one. Try it online! A more efficient ...
Accepted

### Interleave strings

Jelly, 1 byte Z Try it online! The “transpose” built-in will do exactly this to a list of strings.

### Enumerate each series of identical numbers in-place

JavaScript (ES6), 26 bytes 1-indexed. a=>a.map(o=x=>o[x]=-~o[x]) Try it online! Commented ...

Detour ...

### Book Stack Sort

Python, 113 P=[] for n in sorted(input())[::-1]: for p in P: if p[-1]>=n:p+=[n];break else:P+=[[n]] print sum(P,[]) After sorting the list of books ...

### Lossy Sorting (Implement Dropsort)

J, 10 9 bytes #~(=>./\) Working version of my CJam idea (in fewer bytes). E.g.: ...

### Ordering a list

APL, 2 bytes ⍋⍋ The “grade up” built-in, applied twice. Works if indexing starts at 0, which isn’t the default for all flavors of APL. Try it here! Why does ...

### Sort digits by their first occurrence in pi

Python 3, 40 39 bytes 1 byte thanks to Jonathan Allan. lambda s:sorted(s,key="145926870".find) Try it online!