by Suf | Sep 22, 2024 | DSA, Programming, Python, Tips
Introduction Comb sort is a relatively simple yet efficient comparison-based sorting algorithm that improves bubble sort by eliminating turtles (small values at the end of the list) early on. It introduces a gap between compared elements, gradually shrinking...
by Suf | Sep 22, 2024 | DSA, Programming, Python, Tips
Pigeonhole sort is a simple sorting algorithm that is efficient for sorting lists where the number of elements and the range of possible key values are approximately the same. This algorithm distributes elements into “pigeonholes” based on their key...
by Suf | Sep 22, 2024 | DSA, Programming, Python, Tips
Heap sort is an efficient, comparison-based sorting algorithm that relies on a binary heap data structure to sort elements in place. It’s known for its time complexity of O(n log n), making it a reliable choice for large datasets. This blog post will explain how heap...
by Suf | Sep 22, 2024 | DSA, Programming, Python, Tips
Introduction Bucket sort is an efficient sorting algorithm that distributes elements into several “buckets” and then sorts each bucket individually. It is handy when input values are uniformly distributed over a range, as this can lead to a time complexity...
by Suf | Sep 22, 2024 | DSA, Programming, Python
Radix sort is a highly efficient, non-comparison-based sorting algorithm that works by sorting digits of numbers in a specific order. It’s particularly useful for sorting large sets of integers or strings and can be faster than comparison-based algorithms like quick...
by Suf | Sep 22, 2024 | DSA, Programming, Python, Tips
Introduction Counting sort is an efficient, non-comparison-based sorting algorithm that works well when the range of input values is known and limited. It is particularly useful for sorting integers and can achieve linear time complexity in many cases. This blog post...
