{"id":49249,"date":"2025-05-16T16:12:28","date_gmt":"2025-05-16T10:42:28","guid":{"rendered":"https:\/\/www.iquanta.in\/blog\/?p=49249"},"modified":"2025-05-16T16:50:08","modified_gmt":"2025-05-16T11:20:08","slug":"radix-sort-algorithm-working-complexity-applications","status":"publish","type":"post","link":"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/","title":{"rendered":"Radix Sort Algorithm : Working, Complexity &amp; Applications"},"content":{"rendered":"\n<p>As we have came across multiple sorting algorithms like <a href=\"https:\/\/www.iquanta.in\/blog\/bubble-sort-algorithm-with-complexity-analysis\/\">bubble sort<\/a>, <a href=\"https:\/\/www.iquanta.in\/blog\/merge-sort-algorithm-with-complexity-analysis-working\/\">merge sort<\/a>, quick sort, selection sort, insertion sort as well as counting sort. These all algorithms are categorized into two terms those are comparison based and non-comparison based algorithms.<\/p>\n\n\n\n<p>In this blog we are covering another non-comparison based algorithm that is radix sort algorithm. This algorithm is based on the word that is &#8216;radix&#8217; which means base or place value. We will cover it&#8217;s definition, advantages, disadvantages, complexity analysis and applications.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><a href=\"https:\/\/chat.whatsapp.com\/B6weknl7133BQXjPva0pgB\"><img fetchpriority=\"high\" decoding=\"async\" width=\"875\" height=\"142\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-64.png\" alt=\"radix sort algorithm\" class=\"wp-image-49174\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-64.png 875w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-64-300x49.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-64-768x125.png 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-64-150x24.png 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-64-696x113.png 696w\" sizes=\"(max-width: 875px) 100vw, 875px\" \/><\/a><\/figure><\/div>\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_77 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Table of Contents<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#What_is_Radix_Sort_Algorithm\" >What is Radix Sort Algorithm?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Working_of_Radix_Sort_Algorithm\" >Working of Radix Sort Algorithm<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Normalize_Element_Lengths\" >Normalize Element Lengths<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Sort_By_Digits_Right_to_Left\" >Sort By Digits (Right to Left)<\/a><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Pass_1_Sort_by_Units_Place_Rightmost_Digit\" >Pass 1: Sort by Units Place (Rightmost Digit)<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Pass_2_Sort_by_Tens_Place\" >Pass 2: Sort by Tens Place<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Pass_3_Sort_by_Hundreds_Place\" >Pass 3: Sort by Hundreds Place<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Final_Sorted_Array\" >Final Sorted Array<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Implementation_of_Radix_Sort_Algorithm_in_Python\" >Implementation of Radix Sort Algorithm in Python<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-10\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Time_Complexity_of_Radix_Sort\" >Time Complexity of Radix Sort<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-11\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Advantages_of_Radix_Sort\" >Advantages of Radix Sort<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-12\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Disadvantages_of_Radix_Sort\" >Disadvantages of Radix Sort<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-13\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Applications_of_Radix_Sort\" >Applications of Radix Sort<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-14\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Know_More_About_Radix_Sort_Algorithm\" >Know More About Radix Sort Algorithm<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-15\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#What_type_of_data_is_Radix_Sort_best_suited_for\" >What type of data is Radix Sort best suited for?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-16\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Is_Radix_Sort_faster_than_QuickSort\" >Is Radix Sort faster than QuickSort?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-17\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Is_Radix_Sort_a_stable_sorting\" >Is Radix Sort a stable sorting?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-18\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#Where_is_radix_sort_used_in_real_life\" >Where is radix sort used in real life ?<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\" id=\"h-what-is-radix-sort-algorithm\"><span class=\"ez-toc-section\" id=\"What_is_Radix_Sort_Algorithm\"><\/span><strong>What is Radix Sort Algorithm?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Radix Sort Algorithm is a stable and non-comparison based algorithm. Radix sort is a sorting approach where we sort elements in an array according to the base digit of maximum element present in an array. <\/p>\n\n\n\n<p>Radix Sort, Bucket Sort and<a href=\"https:\/\/www.iquanta.in\/blog\/counting-sort-algorithm-working-advantages-and-app\"> Counting Sort<\/a> all are the non-comparison based algorithms. Radix Sort will continue the process of sorting till all the elements are arranged in the correct position in an array. Let&#8217;s explore the working of radix sort algorithm in detail. <\/p>\n\n\n\n<p>Here is a basic example to understand this algorithm <\/p>\n\n\n\n<p>To sort [170, 45, 75, 90, 802, 24, 2, 66], Radix Sort will be like this<\/p>\n\n\n\n<ol>\n<li>Sort by units place: [170, 90, 802, 2, 24, 45, 75, 66]<\/li>\n\n\n\n<li>Then by tens place: [802, 2, 24, 45, 66, 170, 75, 90]<\/li>\n\n\n\n<li>Finally by hundreds place: [2, 24, 45, 66, 75, 90, 170, 802]<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-working-of-radix-sort-algorithm\"><span class=\"ez-toc-section\" id=\"Working_of_Radix_Sort_Algorithm\"><\/span><strong>Working of Radix Sort Algorithm <\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>In this section we will talk about the working of radix sort algorithm step by step in a detailed manner : <\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img decoding=\"async\" width=\"875\" height=\"142\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-76.png\" alt=\"\" class=\"wp-image-49283\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-76.png 875w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-76-300x49.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-76-768x125.png 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-76-150x24.png 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-76-696x113.png 696w\" sizes=\"(max-width: 875px) 100vw, 875px\" \/><\/figure><\/div>\n\n\n<h3 class=\"wp-block-heading\" id=\"h-normalize-element-lengths\"><span class=\"ez-toc-section\" id=\"Normalize_Element_Lengths\"><\/span><strong>Normalize Element Lengths<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>This is the first step where we apply radix sort on each element to made them equal in length by padding zeroes in the beginning of the element like this : <\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\">804<\/td><td class=\"has-text-align-center\" data-align=\"center\">804<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">5<\/td><td class=\"has-text-align-center\" data-align=\"center\">005<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">79<\/td><td class=\"has-text-align-center\" data-align=\"center\">079<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">690<\/td><td class=\"has-text-align-center\" data-align=\"center\">690<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">7<\/td><td class=\"has-text-align-center\" data-align=\"center\">007<\/td><\/tr><\/tbody><\/table><figcaption class=\"wp-element-caption\">Normalize Element Lengths<\/figcaption><\/figure>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full is-resized\"><img decoding=\"async\" width=\"391\" height=\"331\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-72.png\" alt=\"radix sort algorithm\" class=\"wp-image-49254\" style=\"width:422px;height:auto\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-72.png 391w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-72-300x254.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-72-150x127.png 150w\" sizes=\"(max-width: 391px) 100vw, 391px\" \/><\/figure><\/div>\n\n\n<h3 class=\"wp-block-heading\" id=\"h-sort-by-digits-right-to-left\"><span class=\"ez-toc-section\" id=\"Sort_By_Digits_Right_to_Left\"><\/span><strong>Sort By Digits (Right to Left)<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>Next step post appending zero before starting of each elements is to sort the elements by digits in order from right to left. There are different passes are there in this step to sort the digits.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Pass_1_Sort_by_Units_Place_Rightmost_Digit\"><\/span>Pass 1: Sort by Units Place (Rightmost Digit)<span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\"><strong>Number<\/strong><\/td><td class=\"has-text-align-center\" data-align=\"center\"><strong>Units Digit<\/strong><\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">804<\/td><td class=\"has-text-align-center\" data-align=\"center\">4<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">5<\/td><td class=\"has-text-align-center\" data-align=\"center\">5<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">79<\/td><td class=\"has-text-align-center\" data-align=\"center\">9<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">690<\/td><td class=\"has-text-align-center\" data-align=\"center\">0<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">7<\/td><td class=\"has-text-align-center\" data-align=\"center\">7<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>Sorted by units digit<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\"><strong>Sorted Order<\/strong><\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">690<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">804<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">5<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">7<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">79<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Pass_2_Sort_by_Tens_Place\"><\/span>Pass 2: Sort by Tens Place<span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\"><strong>Number<\/strong><\/td><td class=\"has-text-align-center\" data-align=\"center\"><strong>Tens Digit<\/strong><\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">690<\/td><td class=\"has-text-align-center\" data-align=\"center\">9<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">804<\/td><td class=\"has-text-align-center\" data-align=\"center\">0<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">5<\/td><td class=\"has-text-align-center\" data-align=\"center\">0<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">7<\/td><td class=\"has-text-align-center\" data-align=\"center\">0<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">79<\/td><td class=\"has-text-align-center\" data-align=\"center\">7<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>Sorted by tens digit (stable sort)<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\"><strong>Sorted Order<\/strong><\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">804<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">5<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">7<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">79<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">690<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Pass_3_Sort_by_Hundreds_Place\"><\/span>Pass 3: Sort by Hundreds Place<span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\"><strong>Number<\/strong><\/td><td class=\"has-text-align-center\" data-align=\"center\"><strong>Hundreds Digit<\/strong><\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">804<\/td><td class=\"has-text-align-center\" data-align=\"center\">8<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">5<\/td><td class=\"has-text-align-center\" data-align=\"center\">0<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">7<\/td><td class=\"has-text-align-center\" data-align=\"center\">0<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">79<\/td><td class=\"has-text-align-center\" data-align=\"center\">0<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">690<\/td><td class=\"has-text-align-center\" data-align=\"center\">6<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>Sorted by hundreds digit<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\"><strong>Sorted Order<\/strong><\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">5<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">7<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">79<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">690<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">804<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"875\" height=\"142\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-77.png\" alt=\"\" class=\"wp-image-49284\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-77.png 875w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-77-300x49.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-77-768x125.png 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-77-150x24.png 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-77-696x113.png 696w\" sizes=\"(max-width: 875px) 100vw, 875px\" \/><\/figure><\/div>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full is-resized\"><img loading=\"lazy\" decoding=\"async\" width=\"445\" height=\"336\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-73.png\" alt=\"radix sort algorithm\" class=\"wp-image-49255\" style=\"width:425px;height:auto\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-73.png 445w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-73-300x227.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-73-80x60.png 80w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-73-150x113.png 150w\" sizes=\"(max-width: 445px) 100vw, 445px\" \/><\/figure><\/div>\n\n\n<h3 class=\"wp-block-heading\" id=\"h-final-sorted-array\"><span class=\"ez-toc-section\" id=\"Final_Sorted_Array\"><\/span><strong>Final Sorted Array<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>Post sorted by unit digit places we got our sorted array using radix sort <\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full is-resized\"><img loading=\"lazy\" decoding=\"async\" width=\"360\" height=\"322\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-74.png\" alt=\"radix sort algorithm\" class=\"wp-image-49256\" style=\"width:426px;height:auto\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-74.png 360w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-74-300x268.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-74-150x134.png 150w\" sizes=\"(max-width: 360px) 100vw, 360px\" \/><\/figure><\/div>\n\n\n<h2 class=\"wp-block-heading\" id=\"h-implementation-of-radix-sort-algorithm-in-python\"><span class=\"ez-toc-section\" id=\"Implementation_of_Radix_Sort_Algorithm_in_Python\"><\/span><strong>Implementation of Radix Sort Algorithm in Python<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Radix Sort is a way to sort numbers by looking at each digit one by one and starting from the rightmost digit (units place) to the leftmost digit. In Python we can do this by grouping the numbers based on each digit using a list of buckets like 0 to 9 and repeating this for every digit place. This method works best for numbers and is very fast when the numbers are not too large.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"875\" height=\"142\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-78.png\" alt=\"\" class=\"wp-image-49285\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-78.png 875w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-78-300x49.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-78-768x125.png 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-78-150x24.png 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-78-696x113.png 696w\" sizes=\"(max-width: 875px) 100vw, 875px\" \/><\/figure><\/div>\n\n\n<pre class=\"wp-block-code\"><code>def counting_sort(arr, place):\r\n    size = len(arr)\r\n    output = &#091;0] * size\r\n    count = &#091;0] * 10\r\n\r\n    # Count occurrences\r\n    for num in arr:\r\n        digit = (num \/\/ place) % 10\r\n        count&#091;digit] += 1\r\n\r\n    # Cumulative count\r\n    for i in range(1, 10):\r\n        count&#091;i] += count&#091;i - 1]\r\n\r\n    # Build the output array\r\n    i = size - 1\r\n    while i &gt;= 0:\r\n        digit = (arr&#091;i] \/\/ place) % 10\r\n        output&#091;count&#091;digit] - 1] = arr&#091;i]\r\n        count&#091;digit] -= 1\r\n        i -= 1\r\n\r\n    # Copy to original array\r\n    for i in range(size):\r\n        arr&#091;i] = output&#091;i]\r\n\r\ndef radix_sort(arr):\r\n    max_num = max(arr)\r\n    place = 1\r\n    while max_num \/\/ place &gt; 0:\r\n        counting_sort(arr, place)\r\n        place *= 10\r\n\r\n# Example usage\r\narr = &#091;804, 5, 79, 690, 7]\r\nradix_sort(arr)\r\nprint(\"Sorted array:\", arr)\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-time-complexity-of-radix-sort\"><span class=\"ez-toc-section\" id=\"Time_Complexity_of_Radix_Sort\"><\/span><strong>Time Complexity of Radix Sort<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Table 1 shows the time and space complexity of radix sort algorithm that is O(n * k) where n is the number of elements present in an array and k is the number of passes in the algorithm to sort the elements in an array.<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\"><strong>Case<\/strong><\/td><td class=\"has-text-align-center\" data-align=\"center\"><strong>Time Complexity<\/strong><\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Best Case<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n \u00d7 k)<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Average Case<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n \u00d7 k)<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Worst Case<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n \u00d7 k)<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Space<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n + k)<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Stable<\/td><td class=\"has-text-align-center\" data-align=\"center\">Yes<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Comparison-based<\/td><td class=\"has-text-align-center\" data-align=\"center\">No<\/td><\/tr><\/tbody><\/table><figcaption class=\"wp-element-caption\">Table 1 : Radix Sort Algorithm Time Complexity<\/figcaption><\/figure>\n\n\n\n<p>In this table we are comparing radix sort time complexity in all the cases whether it is best case, average case or worst case with other algorithms. Along with comparing the space complexities too.<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\"><strong>Algorithm<\/strong><\/td><td class=\"has-text-align-center\" data-align=\"center\"><strong>Best Case<\/strong><\/td><td class=\"has-text-align-center\" data-align=\"center\"><strong>Average Case<\/strong><\/td><td class=\"has-text-align-center\" data-align=\"center\"><strong>Worst Case<\/strong><\/td><td class=\"has-text-align-center\" data-align=\"center\"><strong>Space Complexity<\/strong><\/td><td class=\"has-text-align-center\" data-align=\"center\"><strong>Stable<\/strong><\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Radix Sort<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n \u00d7 k)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n \u00d7 k)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n \u00d7 k)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n + k)<\/td><td class=\"has-text-align-center\" data-align=\"center\">Yes<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Bubble Sort<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n\u00b2)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n\u00b2)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(1)<\/td><td class=\"has-text-align-center\" data-align=\"center\">Yes<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Insertion Sort<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n\u00b2)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n\u00b2)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(1)<\/td><td class=\"has-text-align-center\" data-align=\"center\">Yes<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Selection Sort<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n\u00b2)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n\u00b2)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n\u00b2)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(1)<\/td><td class=\"has-text-align-center\" data-align=\"center\">No<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Merge Sort<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n log n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n log n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n log n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">Yes<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Quick Sort<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n log n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n log n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n\u00b2)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(log n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">No<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Heap Sort<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n log n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n log n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(n log n)<\/td><td class=\"has-text-align-center\" data-align=\"center\">O(1)<\/td><td class=\"has-text-align-center\" data-align=\"center\">No<\/td><\/tr><\/tbody><\/table><figcaption class=\"wp-element-caption\">Comparison of Radix Sort with other Algorithms<\/figcaption><\/figure>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"875\" height=\"142\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-79.png\" alt=\"\" class=\"wp-image-49286\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-79.png 875w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-79-300x49.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-79-768x125.png 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-79-150x24.png 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-79-696x113.png 696w\" sizes=\"(max-width: 875px) 100vw, 875px\" \/><\/figure><\/div>\n\n\n<figure class=\"wp-block-image size-large\"><img loading=\"lazy\" decoding=\"async\" width=\"1024\" height=\"508\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-1024x508.png\" alt=\"\" class=\"wp-image-49275\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-1024x508.png 1024w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-300x149.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-768x381.png 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-1536x762.png 1536w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-2048x1016.png 2048w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-847x420.png 847w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-150x74.png 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-696x345.png 696w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-1068x530.png 1068w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-75-1920x952.png 1920w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/figure>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-advantages-of-radix-sort\"><span class=\"ez-toc-section\" id=\"Advantages_of_Radix_Sort\"><\/span><strong>Advantages of Radix Sort <\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<ol>\n<li>Radix Sort can achieve linear time O(nk) when the number of digits (k) is small relative to the input size which is making it faster than comparison-based sorts like QuickSort for large datasets.<\/li>\n\n\n\n<li>It maintains the relative order of equal elements which is essential when sorting complex records based on multiple keys.<\/li>\n\n\n\n<li>Especially useful for sorting strings, phone numbers, or IDs where the number of digits and characters are limited.<\/li>\n\n\n\n<li>Radix Sort Algorithm performs well on large datasets.<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-disadvantages-of-radix-sort\"><span class=\"ez-toc-section\" id=\"Disadvantages_of_Radix_Sort\"><\/span><strong>Disadvantages of Radix Sort<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<ol>\n<li>Radix Sort requires extra space for counting and bucketing which makes it less space-efficient compared to in-place sorting algorithms.<\/li>\n\n\n\n<li>It is not suitable for sorting floating-point numbers or negative numbers without significant modifications to the algorithm.<\/li>\n\n\n\n<li>The performance of Radix Sort heavily depends on the number of digits k so it may become inefficient when k is large.<\/li>\n\n\n\n<li>It is less flexible than comparison-based sorts since it only works efficiently with fixed-length or uniformly formatted data.<\/li>\n\n\n\n<li>Radix Sort can be slower than QuickSort or Merge Sort for small datasets due to its overhead in digit wise processing and bucket management.<\/li>\n<\/ol>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"875\" height=\"142\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-80.png\" alt=\"\" class=\"wp-image-49287\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-80.png 875w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-80-300x49.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-80-768x125.png 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-80-150x24.png 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-80-696x113.png 696w\" sizes=\"(max-width: 875px) 100vw, 875px\" \/><\/figure><\/div>\n\n\n<h2 class=\"wp-block-heading\" id=\"h-applications-of-radix-sort\"><span class=\"ez-toc-section\" id=\"Applications_of_Radix_Sort\"><\/span><strong>Applications of Radix Sort<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<ol>\n<li>Radix Sort is commonly used when dealing with large datasets of integers particularly when the number of digits is relatively small. In such cases, it can outperform comparison-based algorithms by providing near-linear time complexity.<\/li>\n\n\n\n<li>Finally, Radix Sort plays a vital role in text processing and string matching tasks like suffix array construction. These applications benefit from Radix Sort\u2019s ability to handle large volumes of substrings or suffixes efficiently and stably.<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-know-more-about-radix-sort-algorithm\"><span class=\"ez-toc-section\" id=\"Know_More_About_Radix_Sort_Algorithm\"><\/span><strong>Know More About Radix Sort Algorithm<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"h-what-type-of-data-is-radix-sort-best-suited-for\"><span class=\"ez-toc-section\" id=\"What_type_of_data_is_Radix_Sort_best_suited_for\"><\/span><strong>What type of data is Radix Sort best suited for?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>Radix Sort works best with numbers or words that have a fixed length, like phone numbers, zip codes, or ID numbers.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"875\" height=\"142\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-81.png\" alt=\"\" class=\"wp-image-49288\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-81.png 875w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-81-300x49.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-81-768x125.png 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-81-150x24.png 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/image-81-696x113.png 696w\" sizes=\"(max-width: 875px) 100vw, 875px\" \/><\/figure><\/div>\n\n\n<h3 class=\"wp-block-heading\" id=\"h-is-radix-sort-faster-than-quicksort\"><span class=\"ez-toc-section\" id=\"Is_Radix_Sort_faster_than_QuickSort\"><\/span><strong>Is Radix Sort faster than QuickSort?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>The answer is yes radix sort is working faster with the large number of datasets in comparison with quick sort.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"h-is-radix-sort-a-stable-sorting\"><span class=\"ez-toc-section\" id=\"Is_Radix_Sort_a_stable_sorting\"><\/span><strong>Is Radix Sort a stable sorting?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>Yes the radix sort is a stable sorting algorithm because when it comes to sort the elements in radix sort this factor comes in the picture.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"h-where-is-radix-sort-used-in-real-life\"><span class=\"ez-toc-section\" id=\"Where_is_radix_sort_used_in_real_life\"><\/span><strong>Where is radix sort used in real life ?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>Radix Sort is used to sort things like phone numbers, ID cards and in some other systems that work with digital data or text.<\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>As we have came across multiple sorting algorithms like bubble sort, merge sort, quick sort, selection sort, insertion sort as well as counting sort. These all algorithms are categorized into two terms those are comparison based and non-comparison based algorithms. In this blog we are covering another non-comparison based algorithm that is radix sort algorithm. [&hellip;]<\/p>\n","protected":false},"author":560,"featured_media":49301,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1075,1073],"tags":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v21.4 (Yoast SEO v21.9.1) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Radix Sort Algorithm : Working, Complexity &amp; Applications - iQuanta<\/title>\n<meta name=\"description\" content=\"Learn about the Radix Sort algorithm, a fast and efficient non-comparative sorting technique that organizes numbers digit by digit.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Radix Sort Algorithm : Working, Complexity &amp; Applications\" \/>\n<meta property=\"og:description\" content=\"Learn about the Radix Sort algorithm, a fast and efficient non-comparative sorting technique that organizes numbers digit by digit.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/\" \/>\n<meta property=\"og:site_name\" content=\"iQuanta\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/facebook.com\/iquanta.in\" \/>\n<meta property=\"article:published_time\" content=\"2025-05-16T10:42:28+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-05-16T11:20:08+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/Your-paragraph-text-21.png\" \/>\n\t<meta property=\"og:image:width\" content=\"1600\" \/>\n\t<meta property=\"og:image:height\" content=\"900\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"Nidhi Goswami\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Nidhi Goswami\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"8 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/\"},\"author\":{\"name\":\"Nidhi Goswami\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3\"},\"headline\":\"Radix Sort Algorithm : Working, Complexity &amp; Applications\",\"datePublished\":\"2025-05-16T10:42:28+00:00\",\"dateModified\":\"2025-05-16T11:20:08+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/\"},\"wordCount\":1063,\"publisher\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#organization\"},\"articleSection\":[\"DSA and Competitive Programming\",\"iSkills\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/\",\"url\":\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/\",\"name\":\"Radix Sort Algorithm : Working, Complexity &amp; Applications - iQuanta\",\"isPartOf\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#website\"},\"datePublished\":\"2025-05-16T10:42:28+00:00\",\"dateModified\":\"2025-05-16T11:20:08+00:00\",\"description\":\"Learn about the Radix Sort algorithm, a fast and efficient non-comparative sorting technique that organizes numbers digit by digit.\",\"breadcrumb\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.iquanta.in\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Radix Sort Algorithm : Working, Complexity &amp; Applications\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#website\",\"url\":\"https:\/\/www.iquanta.in\/blog\/\",\"name\":\"iQuanta | Cat Preparation Online\",\"description\":\"Building Learning Networks\",\"publisher\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.iquanta.in\/blog\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#organization\",\"name\":\"IQuanta\",\"url\":\"https:\/\/www.iquanta.in\/blog\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png\",\"contentUrl\":\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png\",\"width\":525,\"height\":200,\"caption\":\"IQuanta\"},\"image\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/facebook.com\/iquanta.in\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3\",\"name\":\"Nidhi Goswami\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g\",\"caption\":\"Nidhi Goswami\"},\"url\":\"https:\/\/www.iquanta.in\/blog\/author\/nidhigoswami\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"Radix Sort Algorithm : Working, Complexity &amp; Applications - iQuanta","description":"Learn about the Radix Sort algorithm, a fast and efficient non-comparative sorting technique that organizes numbers digit by digit.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/","og_locale":"en_US","og_type":"article","og_title":"Radix Sort Algorithm : Working, Complexity &amp; Applications","og_description":"Learn about the Radix Sort algorithm, a fast and efficient non-comparative sorting technique that organizes numbers digit by digit.","og_url":"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/","og_site_name":"iQuanta","article_publisher":"https:\/\/facebook.com\/iquanta.in","article_published_time":"2025-05-16T10:42:28+00:00","article_modified_time":"2025-05-16T11:20:08+00:00","og_image":[{"width":1600,"height":900,"url":"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/05\/Your-paragraph-text-21.png","type":"image\/png"}],"author":"Nidhi Goswami","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Nidhi Goswami","Est. reading time":"8 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#article","isPartOf":{"@id":"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/"},"author":{"name":"Nidhi Goswami","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3"},"headline":"Radix Sort Algorithm : Working, Complexity &amp; Applications","datePublished":"2025-05-16T10:42:28+00:00","dateModified":"2025-05-16T11:20:08+00:00","mainEntityOfPage":{"@id":"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/"},"wordCount":1063,"publisher":{"@id":"https:\/\/www.iquanta.in\/blog\/#organization"},"articleSection":["DSA and Competitive Programming","iSkills"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/","url":"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/","name":"Radix Sort Algorithm : Working, Complexity &amp; Applications - iQuanta","isPartOf":{"@id":"https:\/\/www.iquanta.in\/blog\/#website"},"datePublished":"2025-05-16T10:42:28+00:00","dateModified":"2025-05-16T11:20:08+00:00","description":"Learn about the Radix Sort algorithm, a fast and efficient non-comparative sorting technique that organizes numbers digit by digit.","breadcrumb":{"@id":"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.iquanta.in\/blog\/radix-sort-algorithm-working-complexity-applications\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.iquanta.in\/blog\/"},{"@type":"ListItem","position":2,"name":"Radix Sort Algorithm : Working, Complexity &amp; Applications"}]},{"@type":"WebSite","@id":"https:\/\/www.iquanta.in\/blog\/#website","url":"https:\/\/www.iquanta.in\/blog\/","name":"iQuanta | Cat Preparation Online","description":"Building Learning Networks","publisher":{"@id":"https:\/\/www.iquanta.in\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.iquanta.in\/blog\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/www.iquanta.in\/blog\/#organization","name":"IQuanta","url":"https:\/\/www.iquanta.in\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png","contentUrl":"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png","width":525,"height":200,"caption":"IQuanta"},"image":{"@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/facebook.com\/iquanta.in"]},{"@type":"Person","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3","name":"Nidhi Goswami","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g","caption":"Nidhi Goswami"},"url":"https:\/\/www.iquanta.in\/blog\/author\/nidhigoswami\/"}]}},"_links":{"self":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts\/49249"}],"collection":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/users\/560"}],"replies":[{"embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/comments?post=49249"}],"version-history":[{"count":15,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts\/49249\/revisions"}],"predecessor-version":[{"id":49291,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts\/49249\/revisions\/49291"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/media\/49301"}],"wp:attachment":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/media?parent=49249"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/categories?post=49249"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/tags?post=49249"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}