Bucket sort
☰Fullscreen
Table of Content:
Bucket sort is not a comparison-based algorithm; instead, it distributes elements into a number of buckets and then sorts these buckets individually. This method takes advantage of the properties of the input data and can achieve linear time complexity under certain conditions. In contrast, merge sort, selection sort, and quick sort are all comparison-based algorithms that determine the order of elements by comparing them.