Skip to main content




Sorting and its Importance
From this point on we will try to understand different methods of sorting and their importance. 
Sorting: Sorting is any process which arranges the items in an ordered way.
Why Sort? Sorting is mainly used for improving our data structure so that we can make our algorithm which we work on to give results faster, ultimately making our algorithm more better at its work. Aside from improving efficiency it is also used for structuring our data and cleaning our data. In a general sense "A sorted data is much easier to handle than an unsorted one".

Why do we need different sorting algorithms? Well in simple terms, to have more tools available at our hand we can use whichever we need to sort easily or in a more efficient way to improve efficiency or simplicity of the program according to the need or priorities. i.e. To make sorting faster or more simpler, as per need.

Example on how sorting helps: Suppose we have a list of unsorted numbers : 1,4,3,7,99,7…

Latest posts

Elevators Algorithm(LOOK)

Elevators Algorithm (SCAN)

Interval Scheduling

Flow Shop Scheduling Algorithm & CPP Code

Round Robin with weights Algorithm

Analysis of algorithms part 1

Round Robin Algorithm

Applications of Linked List (Queue)

Applications of Linked List (Part 1 Stack)

Multiply Linked List Cpp Program Basics to algorithms part 6