Inspiration
Sorting has been an important problem in Computer Science. In this project, we used an efficient sorting algorithm to sort an input list in O(n * log(n)) time.
What's next for Sorting a List in C++
It can be improved to work in a lesser complexity using advanced non-comparison based techniques like Radix or Bucket Sort. To keep it simple, we have decided to use the well-known merge sort algorithm.
Log in or sign up for Devpost to join the conversation.