Help, I've mixed my week up!

Question

My dog ate my calendar, and now my days are all mixed up. I tried putting it back together, but I keep mixing up the days of the week! I need some help putting my calendar back together, with the days in the correct order.

And since I need my calendar put together as fast as possible, don't waste my time by sending me superfluous bytes. The fewer bytes I have to read, the better!

Input

The days of the week, in any order. Input can be taken as a list of strings, or a space separated string, or any reasonable way of representing 7 strings (one for each day of the week).

The strings themselves are all capitalized, as weekdays should be, so the exact strings are:

Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Sunday

Output

The days of the week, in sorted order (Monday - Sunday, because of course we adhere to ISO 8601). Output can be as a list of strings, or printed with some delimiter.

Disclaimer

Note that this is a kolmogorov-complexity challenge, with the added benefit of being able to use the input to shorten your code. You are not required to use the input if you don't want to. You are also free to use any approach, from a builtin datetime library to hard-coding the output.

Examples

To see example input and output, you can consult this python script.

Answer 1

Japt, 8 bytes

n á g#4

Try it here

Answer 2

Python 3, 64 62 59 chars

Takes input as a list of strings, sorts it inplace:

lambda l:l.sort(key=lambda x:'uehrau'.find(x[1],x[0]=='S'))

Try it: https://ideone.com/rYxtff

Answer 3

R (English locale), 36 bytes

weekdays(.leap.seconds[c(8:12,6:7)])

Not quite as short as the other answer, but I posted it because it makes use of one of the strangest objects kicking around in base R — a list of all the leap seconds. It so happens that leap seconds frequently occur in increasing sequences of days so we only have to take two "chunks" from the list.

Luckily, the leap seconds object has the oldest leap second first, so I don't have to qualify this program with "will only work for the next 2–3 years"!

TIO link here.

Answer 4

Uiua, 6 bytes

↻1Days

Boring builtin answer (Days starts with "Sunday", so it needs to be ↻ rotated). You can append ◌ pop for +1 byte if taking input is required.

(Slightly) more interesting 13-byte answer:

⊏∵⋕"1564023"⍆

Selects the correct indices from the sorted input using an array of digits.

Try all three!

Answer 5

Python

Input: Space separated strings

Once the input is sorted then the output should be ordered using indices [1, 5, 6, 4, 0, 2, 3] of the sorted array

inp=sorted(input().split())
for i in [1, 5, 6, 4, 0, 2, 3]:
  print(inp[i])

Try it here

Answer 6

Deadfish~, 464 bytes

{{i}dd}dddc{i}{i}{i}iiiicdc{d}cdddc{i}{i}iiiic{{d}}{d}dc{{i}ddd}iiiic{i}{i}{i}iiic{d}ddddddc{i}iiiic{d}dddddcdddc{i}{i}iiiic{{d}}{d}dc{{i}dd}dddc{i}iiiicdc{i}c{d}ic{i}iiiic{d}dddddcdddc{i}{i}iiiic{{d}}{d}dc{{i}ddd}iiiic{i}{i}c{i}iiicdddcic{d}dddddcdddc{i}{i}iiiic{{d}}{d}dc{{i}dddd}c{{i}dddddd}iiiic{d}icdddddcdddc{i}{i}iiiic{{d}}{d}dc{{i}ddd}iiic{i}iiiic{i}{i}dcicdddc{d}ddddcdddc{i}{i}iiiic{{d}}{d}dc{{i}ddd}iiic{i}{i}{i}iiiic{d}iiic{d}cdddc{i}{i}iiiic{{d}}{d}dc

Try it online!

Deadfish - the worst compression algorithm.

Answer 7

AWK, 63 bytes

$0=gensub(/X/,"day ","g","MonXTueXWednesXThursXFriXSaturXSunX")

Attempt This Online!