A detailed explanation on the immensely innovative solution provided by counting sort.

What is a non-comparison based sorting algorithm ?

A comparison based sorting algorithm that depends on comparing individual elements of the array to determine the order they should be in. However in a non-comparison based sort the algorithm does not rely on comparing individual elements rather it orders them by simply categorizing them.

What is sorting and how does Counting Sort approach the problem ?

Sorting is any process of arranging items systematically, and has two common, yet distinct meanings, One being ordering according to a sequence and the other being categorizing items with similar properties. We look into how Counting Sort achieves ordering by categorization.

In the…

Jaideep Chahal

Student at Bennett University (Batch: EB03, Enrolment Number: E19CSE449)

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store