Which sorting algorithm is not a comparison-based sort?

Which sorting algorithm is not a comparison-based sort?

Step 1: Understand what a sorting algorithm is. A sorting algorithm is a method for arranging elements in a specific order, like numbers from smallest to largest.
Step 2: Learn about comparison-based sorting algorithms. These algorithms sort elements by comparing them to each other, like Bubble Sort or Quick Sort.
Step 3: Identify non-comparison-based sorting algorithms. These algorithms do not rely on comparing elements to sort them.
Step 4: Recognize Counting Sort as an example of a non-comparison-based sorting algorithm. It sorts elements by counting the occurrences of each unique element.
Step 5: Conclude that Counting Sort is not a comparison-based sort because it uses counting instead of comparing elements.

No concepts available.