Considering the complexities in sorting we have come up with algorithms which are efficient in different cases.

What it does

Sort a list / an array.

How we built it

Using python, C++ and Java.

Challenges we ran into

Reducing complexity.

Accomplishments that we're proud of

We have a merge sort which has the worst-case complexity of O(nlogn).

What we learned

Time complexity

What's next for Sorting Algos

Trying to learn other amazing algorithms.

Built With

Share this project: