Inspiration
To Try Something New
What it does
It sorts a list of random numbers using merge sort Merge sort keeps on dividing the list into equal halves until it can no more be divided. By definition, if it is only one element in the list, it is sorted. Then, merge sort combines the smaller sorted lists keeping the new list sorted too.
Accomplishments that we're proud of
Sorting a list using merge Sort.
What we learned
Implementation of merge sort.
What's next for Write Code to Sort a List
Trying other sorting algorithms.
Log in or sign up for Devpost to join the conversation.