Radix Sort Algorithm Explained and Implemented with Examples in Java | Sorting Algorithms | Geekific

The last video we added to this series of sorting algorithms was counting sort. This algorithm is great for sorting integers. However, when the difference between the minimum and maximum value stored in the array we want to sort, is very big, then this algorithm might not turn to be as efficient as it should. To solve this problem radix sort was born. In this video we explain and implement the Radix Sort algorithm.

Timestamps:
00:00 Introduction
00:45 What is Radix Sort?
01:52 Sorting an array using Radix Sort!
04:27 Radix Sort Implementation
07:07 Putting our Code to the Test
07:38 Sorting Negative Values using Radix Sort
10:55 Thanks for Watching!

If you found this video helpful, check other Geekific uploads:

#Geekific #SortingAlgorithms #RadixSort #Java

[victorychibuike]

The way you edit videos is mind blowing. I love the animations, transitions, colors etc

[vitorallacemarquescosta]

You're a god of sorting algorithms, and a god of Java!! I'm in university and i've learned a lot with you!! Thanks for the greatest sorting algorithms video!!

[John-kjtd]

This breakdown was amazing! Looking forward to watching all of your data structures lessons. Many Thanks!!

[Sovit]

The explanation of starting part was nice. The end part was a little complex. Great explanation.😇Thanks.

[dalyasa]

Thanks for the explanation.
I have a question about the time complexity, now without handling the negative values it will be O(nk). what about the implementation that handles the negative values? is it the same time complexity ?

[johnlinley]

Isn’t this bucket sort rather than radix?