Inspiration
What it does
sorts a liste of integer
How we built it
we take the first element as the min and then look for smalled in the rest of the list if found we switch if nnot we let it and go to the other element in the list ect untill getting to the last element
Challenges we ran into
not really it was easy to make
Accomplishments that we're proud of
in process I also learned about quick sort and merge sort but couldn't impliment the code
Log in or sign up for Devpost to join the conversation.