Radix Sort works slightly based on the number system. It works in a O(n) time complexity but there is a certain catch. The elements that need to be sorted should have the same number of digits/characters. The time taken by radix sort is directly proportional to the number of digits/characters in the maximum element. In this video watch a live demonstration how it works behind the scenes followed by a dry-run of the code. This way the concept will stay in your mind forever.

00:00 - Intro
00:53 - Basic Idea of Radix Sort
01:37 - Working of Radix Sort
05:51 - Dry-run of Code
09:12 - Final Thoughts

📚 Links to topics I talk about in the video:
Insertion Sort: [ Ссылка ]
Quick Sort: [ Ссылка ]
Bucket Sort: [ Ссылка ]
Counting Sort: [ Ссылка ]
What is Time Complexity?: [ Ссылка ]

📘 A text based explanation is available at: [ Ссылка ]

Code on Github: [ Ссылка ]
Test-cases on Github: [ Ссылка ]

🔗 To see more videos like this, you can show your support on: [ Ссылка ]

💻 Get Social 💻
Follow on Facebook at: [ Ссылка ]
Follow on Twitter at: [ Ссылка ]
Follow on Tumblr at: [ Ссылка ]
Subscribe to RSS feeds: [ Ссылка ]
Join fan mail: [ Ссылка ]

#algorithm #sorting #tutorial

свернуть