This is the sort of challenge that bytes I need to stop thinking of punny names

Your task is to create as many snippets (programs that have input and output built-in), functions or full programs as possible that sorts whatever your language's version of integer arrays is in ascending order, but for each program, you're only allowed to use the characters in ASCII (or your language's code page, if it's directly specified as not ASCII) which haven't been used in the previous programs.

This is an example answer (separate programs separated by newlines):

Derp
ASdFGHJKLAAA
qwEEERtyRty


In this (fictional language), my first answer is Derp, which used up D, e, r and p. In the second program, I'm not allowed to use those character again, but I can reuse as many characters I want. Same with the third program, and so on.

Each program must take an array of integers, so something like this (see input/output examples for valid input/output styles):

[3 4 -2 5 7 196 -44 -2]


And it must output the items in the array as an array, in ascending order:

[-44 -2 -2 3 4 5 7 196]


Your score will be the total amount of submissions. If there is a tie, the lowest bytecount (least amount of bytes in your code) wins!

Rules for programs:


All submissions must run correctly in one language version (so Python 2 != Python 3).
Your submissions can be snippets, functions, or full programs. You're even allowed to mix and match them - however, you must say which is which, and provide links to working submissions.
Please provide online links to all solutions, if possible.
All submissions must take an array (or a string delimited with any character) as input, and output the array sorted (in your language's array form or as a {any character}-delimited string.
You are not allowed to use any characters outside of ASCII (or your language's code page).


For example, these are valid inputs/outputs:

[1 2 3 4]    (Clojure style arrays)
[1, 2, 3, 4] (Python style arrays)
1 2 3 4 5    (Space-delimited - separated by spaces)
1#2#3#4#5    ("#"-delimited - separated by "#" characters)
1\n2\n3\n4\n (newline-delimited)


Specs for input:


You are guaranteed that the array contains only integers. However, there may be negative numbers, and numbers may repeat indefinitely.
Jelly, 8 programs

Ṣ                   Built-in sort.
¹Þ                  Sort-by the identity function.
Ụị                  Sort indices by values, then index into list.
Œ!Ṃ                 Smallest permutation.
7778Ọv              Eval Unicode 7778 (Ṣ).
ẊI&gt;@-.S$$¿          Bogosort.
&lt;;0œṡ0⁸ṁjµ/         Insertion sort.
AṀ‘¶+Ç©ṬT_©®³ċÐ€®x' A terrifying hack.


The last program is really annoying…

AṀ‘¶+Ç©               Add ® = abs(max(L)) + 1 to the entire list.
                      Now it’s offset to be entirely positive.
       Ṭ              Create a binary array with 1s at these indices.
        T             Find the indices of 1s in this array.
                      The result is sorted, but offset wrong, and lacks duplicates.
         _©®          Subtract the offset, saving this list to ®.
                      Now restore the duplicates:
            ³ċÐ€      Count occurences in the original list.
                ®x'   Repeat the elements of ® that many times.


If I can remove the œṡ from &lt;;0œṡ0⁸ṁjµ/, there’s also this weird one: ²SNr²ZFœ&amp;. Help is appreciated.