Manual Sort without Sort function

[gruntfutuk]

I wish we could use quick sort, but the teacher said no, we have to develop our own sort system by seeing which number is the smallest in the 3 numbers the user typed in, it could be any order the user typed in like 50, 2 1 or 4, 30, 1 or 4, 1, 30. So the code would find the smallest and assign the smallest number to the small variable after it checked all 3 inputs, than it would move onto the next one to find say the largest. and then I'd guess to find the middle one would simply a if statement like if middle is larger than smallest but less than largest it would be middle?

Wow! How frustrating. Well, have fun, and don't forget to deal with the unusual inputs (unless the teacher promised 'happy-path' only. )