Sort a List

• 

  Insertion Sort

Inspiration

Do you know when was the first sorting algorithm was developed and what was it called? The first sorting algorithm was invented by Herman Hollerit, in 1901, who later went on to establish his own company, known as The Tabulating Machine Company. And this company is no other than the present-day IBM. So the first algorithm was developed by a founding member of IBM. It was called the radix sort. As mentioned above, sorting as too many applications in the real world, which really motivates a CS student to do a bit of study on it.

What it does

So basically, sort means to manipulate the elements of some list, which can be anything( Mobile Numbers, A student's marks, House number, etc), depending on the order decided by the user(ascending or descending).

for example :- Lets say one person has an unordered list of student roll number and name. So we can sort the list, in either ascending or descending order of their roll number.

How we built it

Sorting is quite easy, so there are numerous sorting algorithms, which can be developed using any language. Just we have to follow the algorithm.

Challenges we ran into

There is numerous sorting algorithm, but which one is the best? List of all sorting algorithms :- link

What we learned

That there are various algorithm to sort a list, but to choose from it, we have to look after some constraints, like if the list is sorted in reverse order, or the list is fully unordered, or the list is already sorted.

What's next for Sort a List

Well, to make an API, which will help other websites to implement it.

Built With

• c++