# A quine of sorts

Given a string x, output the characters in x sorted according to the order of appearance in your source code.

## Examples

Source: ThisIs A Test
Input: Is it a Test?
Output: TissI   etta?

Source: Harry - yer a wizard.
Input: I'm a what?
Output: aa  wh'?Imt

Source: Mr. H. Potter, The Floor, Hut-on-the-Rock, The Sea
Input:
Output:


## Rules

• Standard loopholes & i/o rules apply
• Input & output can be either a string, a list of characters, or a list of bytes.
• If a character is used multiple times in the source, use the first occurrence.
• If one or more characters does not appear in the source, they should be at the end; their order does not matter, nor does it have to be consistent.
• Source must be non-empty
• Newlines are treated the same as other characters.
• The order in which the code is executed doesn't matter; just the raw string.
• The input is in the same encoding as the code.
• The input is sorted by characters, not by bytes.
• Sorting is case sensitive
• This is , so shortest answer in bytes for each language wins!

let f = (s, i, o) => o.split("").map(x => [x, s.indexOf(x) == -1 ? s.length + 100 : s.indexOf(x)]).sort(([, a], [, b]) => a - b).map(([x]) => x).join("") === o && i.split("").sort().join("") === o.split("").sort().join("");let g = (s, i) => i.split("").map(x => [x, s.indexOf(x) == -1 ? s.length + 100 + Math.random() : s.indexOf(x)]).sort(([, a], [, b]) => a - b).map(([a]) => a).join("");$(() =>$("button").click(() => $("#result").text(f($("#source").val(), $("#input").val(),$("#output").val()) ? "Valid" : Invalid; example output: \${g($("#source").val(), $("#input").val())}\))); body,label{display: flex;flex-direction: column;}*{white-space: pre;font-family: Inconsolata, Consolas, mono-space;font-size: 14px;} <script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/3.3.1/jquery.min.js"></script><label>Source: <textarea id="source">ThisIs A Test</textarea></label><label>Input: <textarea id="input">Is it a Test?</textarea></label><label>Output: <textarea id="output">TissI etta?</textarea></label><div><button>Validate</button> <span id="result"></span></div> • @negativeseven Any characters from the source code encoding need to be accounted for, including whitespace. Jun 27, 2019 at 15:46 • related – Rod Jun 27, 2019 at 17:46 • You should probably make explicit mention in the spec that matching is case sensitive. Jun 27, 2019 at 23:36 • Can we get x encoded in UTF-8 or UTF-16 if our solution isn't encoded in Unicode at all, and the Unicode characters in x represent characters in the solution's code page? For example, some golfing languages use custom code pages to reduce their byte count but still be readable with the naked eye. Jun 29, 2019 at 7:03 • @tjjfvi I'm not talking about no-ops here (which would be certainly invalid); at least a few of the answers below, instead of taking input in plain bytes (0x00-0xFF), take the input as the UTF-8 string that the byte sequence would represent (e.g. when we post an answer, we usually post the UTF-8 version of our code, not the hexdump), and then use the UTF-8 representation of the source code to sort the input. Is this allowed? I feel like it should be an option too (alongside the plain byte stream), because otherwise solutions in golfing languages with custom codepages would be hindered greatly. Jun 30, 2019 at 19:19 ## 20 Answers # Python 3.8 (pre-release), 10210096857976686159 60 bytes c="print(sorted(x:=input(),key=('c=%r;'%c+x).find))";exec(c)  Try it online! -2 bytes by using this -4 bytes by realizing that <0 == ==-1 and removing the unnecessary +1 -11 bytes thanks to Neil -6 bytes thanks to dzaima -3 bytes thanks to rod -8 bytes thanks to negative seven pointing out that the program can output a list of chars -7 bytes due to Embodiment of Ignorance switching back to Python 3.8 and using := -2 bytes due to Jo King switching out the variable name s for c, so we could leave out the ;c +1 bytes because negative seven pointed out that it wasn't filtering ; correctly • ('s=%r;exec(s)'%s+x).find(x)? – Neil Jun 27, 2019 at 17:21 • @Neil Is the current solution invalid, and substituting ('s=%r;exec(s)'%s).find(x) with your code would make it valid? Jun 27, 2019 at 17:24 • @Neil Oh, wait, I see your golf Jun 27, 2019 at 17:28 • You can switch to input() and save 4 bytes – Rod Jun 27, 2019 at 18:03 • ; isn't being sorted correctly in the current version Jun 28, 2019 at 16:45 # APL (Dyalog Unicode), 14 bytesSBCS Anonymous tacit prefix function. '''∘⍋⊃¨⊂'∘⍋⊃¨⊂  ⊂ enclose argument (to act on it as a whole) ⊃¨ from that, pick one character for each of the following indices: ∘⍋ the indices that would sort the argument in the the order given by the following string (all non-members go in order of appearance at the end): '''∘⍋⊃¨⊂' the characters '∘⍋⊃¨⊂ Try it online! # C# (Visual C# Interactive Compiler), 48 bytes n=>n.OrderBy((@"n=>.OrdeBy(@""+)Ixf"+n).IndexOf)  Try it online! # JavaScript (Node.js), 60 58 56 bytes -2 bytes from Jo King f=_=>_.sort((a,b)=>(p=g=>f=${f+g}.indexOf(g))(a)-p(b))


Try it online!

• Your code seems to only work when the source is f=.... If that is the case, please include that in your submission & byte count. Jun 27, 2019 at 17:31

# Jelly, 14 bytes

“;fɓḟṾⱮ”ṾɓfⱮ;ḟ


A full program accepting a (Python formatted) string (of Jelly code-page characters) which prints the output.
(as a monadic link it yields a list of lists of characters)

Try it online!

### How?

“;fɓḟṾⱮ”ṾɓfⱮ;ḟ - Main Link: list of characters, S
“;fɓḟṾⱮ”       - list of characters = [';', 'f', 'ɓ', 'ḟ', 'Ṿ', 'Ɱ']
Ṿ      - un-evaluate = ['“', ';', 'f', 'ɓ', 'ḟ', 'Ṿ', 'Ɱ', '”']
ɓ     - start a new dyadic chain, F(S, T=that):
Ɱ   - for each character, t, in T:
f    -   (S) filter keep any of (the single character, t)
ḟ - (S) filter discard any of (the characters in T)
;  - concatenate

• So... I posted my Jelly answer, and then it clicked on me: the interpreter converts the bytecode to UTF-8 before executing it, hence either the bytecount should be increased, or the code be changed to fit the codepage. Jun 28, 2019 at 19:23
• @EriktheOutgolfer I think this one is safe in that respect since this method does not employ any sorting and meets the I/O being in the same encoding (Jelly's code page) criteria. Jun 28, 2019 at 19:51
• Eh... I think the f and ḟ work on Unicode characters, because that's what kind of characters the string actually has inside. For example ”ĿO returns 319 if tested locally encoded in JELLY, so it sees the Ŀ and not the C7. Jun 28, 2019 at 19:59
• I think f and ḟ work on Unicode too, but is that a problem here? I pass in the restricted set of Unicode characters that appear on Jelly's code page (that is, bytes encoded using that encoding, fulfilling "The input is in the same encoding as the code"); filter them correctly (since these inputted bytes were encoded as Unicode), and then output them correctly. What I then count is the bytes of the code (fulfilling "The input is sorted by characters, not by bytes" and "shortest answer in bytes for each language wins"). Jun 28, 2019 at 20:08
• @JonathanAllan I feel like the "have been encoded to some characters using Jelly's code-page" is what I'm referring to in my previous comment. Since the code's encoding consists of single bytes from 0x00 to 0xFF, that's what the argument's encoding should consist of too, Instead, the argument is passed after being mapped from JELLY to UTF-8, so each of its characters isn't necessarily a single byte anymore. Basically, the code is in JELLY while the argument is in UTF-8, even though it has been mapped to that from JELLY. While the correct UTF-8 output is returned, it should be JELLY all along. Jun 28, 2019 at 20:38

# Perl 6, 56 bytes

<slurp.comb.sort({"<$_>~EVAL$^a".index($a)}).say>~~.EVAL  Try it online! # Jelly, 16 14 bytes (Jelly Code page), 25 bytes (UTF8) “ṾvṾ;³³i@Þ”v  Try it online! A full program that takes a single argument, the string to be sorted. Thanks to @JonathanAllan for pointing out a bug! As per @EriktheOutgolfer, although the code can be input using the Jelly code page, the characters sorted are the equivalent UTF-8 ones rather than the bytes of the source. As such, I’ve included the score in UTF-8 bytes as well. Note the same probably applies to all languages with custom code pages. ### Explanation “ṾvṾ;³³i@Þ” | The string "ṾvṾ;³³i@Þ", referred to below as S v | Evaluate this string as Jelly code using the string itself as the argument  The string above evaluates as: Ṿ | Uneval the string S (effectively wraps it in “”) v | Eval it (effectively removes the “”) Ṿ | Uneval it again, adding back in the “” ;³ | Concatenate the input to this ³i@Þ | Sort the input with respect to the first occurence of each character in the “”-wrapped string S concatenated to the input  Ṿv is a no-op effectively here, but exists to ensure all characters are represented. • So... I posted my Jelly answer, and then it clicked on me: the interpreter converts the bytecode to UTF-8 before executing it, hence either the bytecount should be increased, or the code be changed to fit the codepage. Jun 28, 2019 at 19:24 • @EriktheOutgolfer I don’t understand what you’re getting st here. How is this different to any other codegolf challenge in this regard? Jun 28, 2019 at 19:27 • The self-referential aspect is different, so, in fact, the code sorts UTF-8 characters and not the bytes it's supposed to. Jun 28, 2019 at 19:28 # Ruby, 57 bytes ->s{s.sort_by{|o|%{->s{.ort_by|%}index()9}.index(o)||99}}  Try it online! Fairly straightforward, assuming I haven't missed a golfing trick. Take in a list of characters and sort by their index in a string consisting of all the uniq characters in the code in order of their appearance. Often their first appearance is in that very string, but that doesn't change the order. # 05AB1E, 2422 21 bytes Σ"Σ"'"«"'«Rrk}"«Rrk}R  Try it online! Explanation: Σ } # Sort "Σ" # Σ string literal '" # " string literal « # Concatenate last two literals "'«Rrk}" # '«Rrk} another literal « # Concat again R # Reverse literal (so: }krR'«'"Σ) r # reverse stack k # find the current sorting index in our code string R # reverse our sorted string  First time trying stuff in 05AB1E so probably lots to be saved • Are you sure this is correct? The string it now sorts on is }krR«'«. NOTE: ' is a single character, so just '" is enough (unlike C# where it needs an additional trailing '). Currently your code first pushes the string Σ, then the string ", then the string «, then the string '«Rrk}, and then it does the append, reverse, reverse stack, index. Smart usage of the reverse of the string and at the end, though! I will see if I can find a fix for your answer, and will delete mine afterwards. Jun 27, 2019 at 16:58 • @kevincruijssen So can't I just get rid of the second ' Jun 27, 2019 at 17:00 • Yeah, you indeed can. :) Then it correctly sorts on }krR«'"Σ. PS: I tend to use = (print without popping) for debug purposes sometimes. You can also add --debug-stack as argument, but it's a bit weird in the new 05AB1E version imho. Jun 27, 2019 at 17:03 # 05AB1E, 3126 19 bytes Σ'"'ÿs"Σ'ÿÿsìyk"ìyk  -7 bytes by taking inspiration of @EmbodimentOfIgnorance's approach in his C# answer of appending the current character before indexing. Explanation: Σ # Sort the (implicit) input-string by: '" '# Push string '"' 'ÿ '# Push string "ÿ" s # Swap the order of these two strings on the stack "Σ'ÿÿsìyk" # Push string "Σ'ÿÿsìyk", where the ÿ are automatically filled with # the previous strings we created: Σ'"ÿsìyk # (top to bottom from stack; left to right in string) ì # Prepend this string in front of the character we're sorting yk # And then get the index of the character we're sorting in this string # (after the sorting the resulting string is output implicitly)  • Strictly speaking I had that inspiration over 12 hours earlier when I golfed 11 bytes of @MilkyWay90's answer... – Neil Jun 29, 2019 at 23:46 • This is good! I saw that but couldn't see a way to turn mine into this while saving bytes Jun 29, 2019 at 23:47 # Charcoal, 37 bytes ≔´≔´´´η´Ｆ´Φ´θ´⁼´ι´κ´¬´№ηＦηΦθ⁼ικΦθ¬№ηι  Try it online! Explanation: ≔´≔´´´η´Ｆ´Φ´θ´⁼´ι´κ´¬´№η  There are two ways of quoting characters in Charcoal; ´ quotes any single character while ”y...” quotes any character except ” and also counts as a separate string. It turns out that the overhead in having to deal with ” means that it doesn't end up any golfier. ＦηΦθ⁼ικ  Loop over the characters in turn, outputting any matching characters from the input. This sorts the input. Φθ¬№ηι  Output any unmatched characters in the input. # J, 14 bytes Anonymous tacit prefix function. ]/:']/:''i'i:]  Try it online! ] the argument i: last occurrence (non-members get the index beyond end of lookup string) of each character in: ']/:''i' the characters ]/:'i /: use that to sort: ] the argument • Are the four leading spaces a result of the echo or the code? Jun 27, 2019 at 16:27 • @tjjfvi It is how TIO is configured. Fixed now. – Adám Jun 27, 2019 at 16:43 # Java 10, 129 100 bytes s->{s.sort(java.util.Comparator.comparing(c->("s->{.ort(javuilCmpcng\"\\+)dexOf;}"+c).indexOf(c)));}  -29 bytes by porting the +c from @EmbodimentOfIgnorance's C# answer. Try it online. Explanation: s->{ // Method with char-List parameter and no return-type s.sort(java.util.Comparator.comparing(c-> ("s->{.ort(javuilCmpcng\"\\+)dexOf;}" // Push a String containing the characters in the code +c) // Append the current character .indexOf(c) // And get the first index of the current character in the String  NOTE: Usually it's cheaper to use s.sort((a,b)->Long.compare(a,b)) instead of s.sort(java.util.Comparator.comparing(c->c), but in this case it would be 11 bytes longer: s->{var v="s->{var =\"\\;.ot(,)Lngcmpe+idxOf}";s.sort((a,r)->Long.compare((v+a).indexOf(a),(v+r).indexOf(r)));}  Try it online. # PowerShell, 68 bytes $p=$args &($t={$p|sort-object{"$p=$args &($t={$t})$_"|% i*f $_}})  Try it online! • 1) sort instead sort-object works too. 2) the variable $b defined out of scope your code. the Standard loopholes requires a complete answer. For Powershell it means: any person can wirte the code to a file as a powershell script and run it in a terminal. Your code does not work from script file. Sorry. Jun 28, 2019 at 11:14
• @mazzy, thank you very much. 1) the sort alias does not work in pwsh on Ubuntu 18.04 2) yes, this is my fault, but I corrected myself, and as a result, the code became longer, of course :) Jun 28, 2019 at 15:55
• (oO)! I've created sort alias for Powershell. code became longer - this is the challenge :) Jun 28, 2019 at 17:15
• Yes, you are right. Each individual character of $p is append to the end of the string with the source code and gets an index equal to $src.Length, but since “their order does not matter and should not be consistent,” it is not matter. In this answer, the entire input string is appended to the end of the string with the source code. Jun 29, 2019 at 9:35
• @dfeuer, I don't understand your question. Sorry. Jun 30, 2019 at 4:27

# Python 2, 62 bytes

lambda a:sorted(a,key=('lambd :sorted(,ky=\'\\+).fin'+a).find)


Same concept as my C# answer.

Try it online!

• \\\' should be \'\\. Nice approach though! Saved 23 bytes in my Java answer. Jun 28, 2019 at 9:45
• @KevinCruijssen Fixed Jun 29, 2019 at 3:18

# Japt, 18 7 bytes

Takes input as an array of characters

nQi"nQi


Try it

# Jelly, 26 bytes (UTF-8*)

“®³nÞṾ©V”Ṿ©VV


Try it online!

Takes input as a Python-formatted string in the 1st command-line argument.

“®³nÞṾ©V”


*Note: I discovered that this doesn't work when encoded in JELLY, since it sorts the UTF-8 characters instead of its own bytes.

# ReRegex, 335 bytes

([^(])$$/(1/([^(])$/[1/([^($$])\^/^1/([^(\[^])]/]1/([^(\[^$])$$/)1/([^($^$)])\\/\$1/([^($^$)\$$)\//\/1/([^($^$)\\\/])$$\/$/extract_tex]1/([^($$^$)\\\/])1/11/([^($^$)\\\/1])\#/\#1/([^($^$)\\\/1\#])i/i1/([^($^$)\\\/1\#i])n/n1/([^($^$)\\\/1\#in])p/p1/([^($^$)\\\/1\#inp])u/u1/([^($^$)\\\/1\#inpu])t/t1/#input  A Naïve solution, bubble sorts characters to the left based on their occurance in the source code, which only consists of the characters ([^])\/1#input (in order). Unfortunately, it requires a separate regex for each character, which gets progressively longer per index. Seperating the regexes for readability gives: ([^(])$$/(1/ ([^(])$/[1/ ([^(\[])\^/^1/ ([^(\[^])]/]1/ ([^(\[^$])$$/)1/ ([^($^$)])\\/\$1/ ([^($^$)\$$)\//\/$1/ ([^($^$)\\\/])$$\/$/extract_tex]1/ ([^(\[^$)\\\/$])1/1$1/ ([^($^$)\\\/$1])\#/\#$1/ ([^($^$)\\\/$1\#])i/i$1/ ([^($^$)\\\/$1\#i])n/n$1/ ([^($^$)\\\/$1\#in])p/p$1/ ([^($^$)\\\/$1\#inp])u/u$1/ ([^($^$)\\\/$1\#inpu])t/t\$1/
#input


Try it online!

# brainfuck, 647 bytes

,[>>>+>,]<<<<[<<<<]>>>>[[->+>+<<]--[>-<++++++]>-<+>[<->[-]]<[>>.>-<<<-]>>[-<<+>>]>>]<<<<[<<<<]>>>>[[->+>+<<]-[>-<---]>------<+>[<->[-]]<[>>.>-<<<-]>>[-<<+>>]>>]<<<<[<<<<]>>>>[[->+>+<<]----[>-<----]>+<+>[<->[-]]<[>>.>-<<<-]>>[-<<+>>]>>]<<<<[<<<<]>>>>[[->+>+<<]--[>-<++++++]><+>[<->[-]]<[>>.>-<<<-]>>[-<<+>>]>>]<<<<[<<<<]>>>>[[->+>+<<]-[>-<---]>--------<+>[<->[-]]<[>>.>-<<<-]>>[-<<+>>]>>]<<<<[<<<<]>>>>[[->+>+<<]----[>-<----]>+++<+>[<->[-]]<[>>.>-<<<-]>>[-<<+>>]>>]<<<<[<<<<]>>>>[[->+>+<<]--[>-<++++++]>--<+>[<->[-]]<[>>.>-<<<-]>>[-<<+>>]>>]<<<<[<<<<]>>>>[[->+>+<<]--[>-<++++++]>---<+>[<->[-]]<[>>.>-<<<-]>>[-<<+>>]>>]<<<<[<<<<]>>>>[>>>[<<<.>>>-]>]


This was a mouthful. For each of Brainfuck's 8 command characters (In order of source appearance), compares them to each character of the input and outputs it when they occur. After each character is done, it outputs whatever wasn't found.

## Ungolfed

,[>>>+>,]             Load each character of input with some memory padding
<<<<[<<<<]>>>>         Navigate to the start

[                   For each COMMA
[->+>+<<]           Copy over the next two
--[>-<++++++]>-     Subtract 44
<+>[<->[-]]<[       If NOT Zero
>>.                 Write it
>-                  Unset the remember flag
<<<-                And unset the test flag
]
>>[-<<+>>]          Copy Back
>>                  Next Char
]<<<<[<<<<]>>>>     And Reset

[                   For each LEFT BRACKET
[->+>+<<]           Copy over the next two
-[>-<---]>------    Subtract 91
<+>[<->[-]]<[       If NOT Zero
>>.                 Write it
>-                  Unset the remember flag
<<<-                And unset the test flag
]
>>[-<<+>>]          Copy Back
>>                  Next Char
]<<<<[<<<<]>>>>     And Reset

[                   For each RIGHT ANGLE BRACKET
[->+>+<<]           Copy over the next two
----[>-<----]>+     Subtract 62
<+>[<->[-]]<[       If NOT Zero
>>.                 Write it
>-                  Unset the remember flag
<<<-                And unset the test flag
]
>>[-<<+>>]          Copy Back
>>                  Next Char
]<<<<[<<<<]>>>>     And Reset

[                   For each PLUS
[->+>+<<]           Copy over the next two
--[>-<++++++]>      Subtract 43
<+>[<->[-]]<[       If NOT Zero
>>.                 Write it
>-                  Unset the remember flag
<<<-                And unset the test flag
]
>>[-<<+>>]          Copy Back
>>                  Next Char
]<<<<[<<<<]>>>>     And Reset

[                   For each RIGHT BRACKET
[->+>+<<]           Copy over the next two
-[>-<---]>--------  Subtract 93
<+>[<->[-]]<[       If NOT Zero
>>.                 Write it
>-                  Unset the remember flag
<<<-                And unset the test flag
]
>>[-<<+>>]          Copy Back
>>                  Next Char
]<<<<[<<<<]>>>>     And Reset

[                   For each LEFT ANGLE BRACKET
[->+>+<<]           Copy over the next two
----[>-<----]>+++   Subtract 60
<+>[<->[-]]<[       If NOT Zero
>>.                 Write it
>-                  Unset the remember flag
<<<-                And unset the test flag
]
>>[-<<+>>]          Copy Back
>>                  Next Char
]<<<<[<<<<]>>>>     And Reset

[                   For each MINUS
[->+>+<<]           Copy over the next two
--[>-<++++++]>--    Subtract 45
<+>[<->[-]]<[       If NOT Zero
>>.                 Write it
>-                  Unset the remember flag
<<<-                And unset the test flag
]
>>[-<<+>>]          Copy Back
>>                  Next Char
]<<<<[<<<<]>>>>     And Reset

[                   For each DOT
[->+>+<<]           Copy over the next two
--[>-<++++++]>---   Subtract 46
<+>[<->[-]]<[       If NOT Zero
>>.                 Write it
>-                  Unset the remember flag
<<<-                And unset the test flag
]
>>[-<<+>>]          Copy Back
>>                  Next Char
]<<<<[<<<<]>>>>     And Reset

[       For each remaining character
>>>[    If the remember flag is still set
<<<.    Write it
>>>-    Unset the flag
]>      Next character
]       Until it is done


Try it online!

# Thunno 2J, 18 bytes

"XÞxṘs+nȮ"XÞxṘs+nȮ


#### Explanation

"XÞxṘs+nȮ"XÞxṘs+nȮ  # Implicit input
"XÞxṘs+nȮ"          # Push the string "XÞxṘs+nȮ"
X         # Pop and store in the variable x
Þ        # Sort the input by the following:
x       #  Push x, "XÞxṘs+nȮ"
Ṙ      #  Get its representation (surround by quotes)
s+    #  Append the current character
nȮ  #  And get its index in this string
# Implicit output, joined by the J flag