Inspiration
It's been a couple months since I've coded in python, and I thought a list sort would be a perfect way to get back into the language.
What it does
The Numeric Sortatron MK 1 takes a list of numbers inputted by the user and copies the unsorted list into a blank list. One list is then "manually sorted" (ie. the .sort() method is not used) and he other list is sorted using the .sort() method to eventually test if the first list was correctly sorted. Both lists are then compared and the user receives a message that the lists either have or have not been sorted. After, the user is asked if they would like the numbers to display largest to smallest (ltos) or smallest to largest (stol) and whichever option they chose prints the normal or reversed list.
How we built it
I used for loops and conditional statements to sort the list manually, used the .sort() function to check the manually sorted list, and used input statements to select the method of display. List operators were used throughout the program.
Challenges we ran into
I ran into two challenges in this project: (1) How to check if two lists are equivalent and (2) getting the ranges right for the sort.
Accomplishments that we're proud of
I'm proud of myself for figuring out the ranges and creating an efficient program.
What we learned
'range' is not needed for for-loops, it's only needed for numeric datatypes.
What's next for The Numeric Sortatron MK 1
One defect of the NSMK1 is its inability to sort any datatype besides int. For the NSMK 2, the sort will be expanded to incorporate string datatypes!

Log in or sign up for Devpost to join the conversation.