Radix Sort Using Couting Sort

Duration: 32 min

This video lesson is available to enrolled students.

Return to /learn/NTA-UGC-NET-PAPER-2/unit-7-data-structures-and-algorithms/sorting-algorithms/radix-sort/asset-radix-sort-using-couting-sort after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Course Overview: About the Course
  2. Paper - 1 | Unit - 1 | Teaching Aptitude: Concept and Objectives of Teaching / शिक्षण की अवधारणा एवं उद्देश्य, Levels of Teaching / शिक्षण के स्तर, Learner's Characteristics / शिक्षार्थी की विशेषताएँ, Learning: Nature and Theories / अधिगम: प्रकृति एवं सिद्धांत, Cognition, Memory and Metacognition / संज्ञान, स्मृति एवं अधिसंज्ञान, Factors Affecting Teaching / शिक्षण को प्रभावित करने वाले कारक, Effective Teaching and the Teacher / प्रभावी शिक्षण एवं शिक्षक, Instructional Objectives and Lesson Planning / अनुदेशनात्मक उद्देश्य एवं पाठ नियोजन, Methods of Teaching / शिक्षण विधियाँ, Offline and Online Teaching Methods / ऑफ़लाइन एवं ऑनलाइन शिक्षण विधियाँ, Teaching Support System / शिक्षण सहायक प्रणाली, Evaluation Systems / मूल्यांकन प्रणाली, Sāṃkhya / सांख्य, Individual Behaviour / व्यक्तिगत व्यवहार, Human Resource Management / मानव संसाधन प्रबंधन, Domains of Child Development / बाल्यावस्था में विकास के क्षेत्र, Biological Basis of Emotion / संवेग का जैविक आधार, Upanishads and Bhagavad Gita / उपनिषद और भगवद्गीता, Central and Peripheral Nervous Systems / केन्द्रीय और परिधीय तंत्रिका तंत्र
  3. Paper - 1 | Unit - 2 | Research Aptitude: Research: Meaning, Features and Scientific Method / अनुसंधान: अर्थ, लक्षण व वैज्ञानिक विधि, Research Paradigms and Approaches / अनुसंधान के प्रतिमान एवं उपागम, Types of Research / अनुसंधान के प्रकार, Variables and Measurement / चर एवं मापन, Methods of Research / अनुसंधान की विधियाँ, Steps of Research / अनुसंधान के चरण, Sampling / प्रतिचयन, Tools and Methods of Data Collection / आँकड़ा संग्रह के उपकरण एवं विधियाँ, Data Analysis and Statistics in Research / आँकड़ा विश्लेषण एवं शोध सांख्यिकी, Thesis and Article Writing / शोध-प्रबंध एवं लेख लेखन, Application of ICT in Research / अनुसंधान में ICT का अनुप्रयोग, Research Ethics / शोध नैतिकता
  4. Paper - 1 | Unit - 3 | Comprehension: Literal Comprehension, Vocabulary and Language in Context, Inferential Comprehension, Critical Comprehension, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Restoration and Eighteenth-Century Drama, Modern British Fiction, William Shakespeare, Mid-Twentieth-Century and Contemporary British Fiction, American Drama
  5. Paper - 1 | Unit - 4 | Communication: Communication: Meaning, Nature and Process / संचार: अर्थ, प्रकृति एवं प्रक्रिया, Types and Levels of Communication / संचार के प्रकार एवं स्तर, Verbal and Non-verbal Communication / मौखिक एवं अमौखिक संचार, Semiotics and Meaning / संकेत विज्ञान एवं अर्थ, Models and Theories of Communication / संचार के मॉडल एवं सिद्धांत, Effective Communication / प्रभावी संचार, Barriers to Communication / संचार की बाधाएँ, Classroom Communication / कक्षा संचार, Mass Media: Types and Evolution / जनसंचार माध्यम: प्रकार एवं विकास, Mass Media and Society / जनसंचार एवं समाज, Digital and New Media / डिजिटल एवं नव माध्यम, Static General Knowledge / स्थैतिक सामान्य ज्ञान, Morphology and Syntax, Public Health Nutrition / जन स्वास्थ्य पोषण, Newtonian Motion and Stability, GK- Current Affairs / GK- समसामयिकी, Indian Economy / भारतीय अर्थव्यवस्था, Art and Architecture / कला और स्थापत्य, India after Independence / स्वतंत्रता के बाद भारत
  6. Paper - 1 | Unit - 5 | Mathematical Reasoning and Aptitude: Number System and Simplification / संख्या पद्धति एवं सरलीकरण, Algebra and Ages / बीजगणित एवं आयु, Percentage / प्रतिशतता, Ratio, Proportion, Partnership and Mixtures / अनुपात, समानुपात, साझेदारी एवं मिश्रण, Averages / औसत, Profit, Loss and Discount / लाभ, हानि एवं बट्टा, Simple and Compound Interest / साधारण एवं चक्रवृद्धि ब्याज, Time and Work / समय एवं कार्य, Speed, Time and Distance / चाल, समय एवं दूरी, Mensuration and Geometry / क्षेत्रमिति एवं ज्यामिति, Series / श्रेणी, Coding-Decoding / कूटलेखन-कूटवाचन, Relationships, Directions and Ranking / संबंध, दिशा एवं क्रम, Arrangements, Puzzles, Clock and Calendar / व्यवस्था, पहेलियाँ, घड़ी एवं कैलेंडर, Mathematical Foundations, Polity / राजव्यवस्था, जीवनी, Deconstruction, Gender and Queer Theory, Modern British and Irish Poetry, Central Force and Scattering, Chemical thermodynamics, Microscopic techniques, Philosophy of the Constitution / संविधान का दर्शन, Waves, Optics and Charged-Particle Motion, Membrane structure and function, Analysis
  7. Paper - 1 | Unit - 6 | Logical Reasoning: Structure of Arguments / युक्ति की संरचना, Terms, Definitions and Uses of Language / पद, परिभाषा एवं भाषा के उपयोग, Categorical Propositions / निरुपाधिक प्रतिज्ञप्तियाँ, Categorical Syllogism / निरुपाधिक न्यायवाक्य, Venn Diagrams / वेन आरेख, Deduction, Induction and Analogy / निगमन, आगमन एवं सादृश्यता, Fallacies / तर्कदोष, Indian Logic: Pramanas / भारतीय तर्कशास्त्र: प्रमाण, Anumana and Vyapti / अनुमान एवं व्याप्ति, Hetvabhasa / हेत्वाभास, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Aristotle / अरस्तू, Western Schools of Philosophy / पाश्चात्य दर्शन की विचारधाराएँ, Kant / कांट, Sadhana Paada, Vaiśeṣika / वैशेषिक
  8. Paper - 1 | Unit - 7 | Data Interpretation: Data and Graphical Representation / आँकड़े एवं आलेखीय निरूपण, Data Interpretation: Tables / आँकड़ा निर्वचन: तालिका
  9. Paper - 1 | Unit - 8 | Information and Communication Technology: Computer Fundamentals and Hardware, Memory, Storage and Data Representation, Computer Software, Office Applications, Multimedia and File Formats, Computer Networks, Internet and World Wide Web, Email and Online Communication, Cyber Security, Digital Ethics, IPR and Society, Cloud and Distributed Computing, Emerging Technologies, ICT in Education and Governance, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Electronic Data Interchange and E-Commerce, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Emerging Technologies, Terms & Abbreviations, Society, Law & Ethics, Keyboard Shortcuts, Website, Browser & Services, Protection of Geographical Indications / भौगोलिक संकेतों का संरक्षण
  10. Paper - 1 | Unit - 9 | People Development and Environment: Ecosystems and Biodiversity / पारितंत्र और जैव विविधता, Human and Environment Interaction / मानव और पर्यावरण की अंतःक्रिया, Development and Environment / विकास और पर्यावरण, Natural Resources – Forests, Water and Soil / प्राकृतिक संसाधन: वन, जल और मृदा, Energy Resources / ऊर्जा संसाधन, Air Pollution / वायु प्रदूषण, Water Pollution and Treatment / जल प्रदूषण और उपचार, Noise Pollution / ध्वनि प्रदूषण, Waste Management / अपशिष्ट प्रबंधन, Environmental Health and Toxicology / पर्यावरणीय स्वास्थ्य और विषविज्ञान, Climate Change and Global Environmental Issues / जलवायु परिवर्तन और वैश्विक पर्यावरणीय समस्याएँ, Natural Hazards and Disaster Management / प्राकृतिक प्रकोप और आपदा प्रबंधन, Indian Environmental Laws and Policies / भारतीय पर्यावरण कानून और नीतियाँ, International Environmental Agreements / अंतर्राष्ट्रीय पर्यावरण समझौते, Environment / पर्यावरण, Geography / भूगोल, Factory and Industry Systems / कारखाना और उद्योग व्यवस्थाएँ, Earth Materials, Surface Features and Processes, Communicable Diseases and Immunization / संक्रामक रोग और प्रतिरक्षण
  11. Paper - 1 | Unit - 10 | Higher Education System: Education in Ancient India / प्राचीन भारत में शिक्षा, Ancient Centres of Higher Learning / प्राचीन भारत के उच्च शिक्षा केंद्र, Colonial Education Policies and Commissions / औपनिवेशिक काल की शिक्षा नीतियाँ और आयोग, Colonial Colleges, Universities and Reformers / औपनिवेशिक कॉलेज, विश्वविद्यालय व सुधारक, Education Commissions and Policies after Independence / स्वतंत्र भारत में शिक्षा आयोग और नीतियाँ, National Education Policy 2020 / राष्ट्रीय शिक्षा नीति 2020, Types of Higher Education Institutions / उच्च शिक्षा संस्थानों के प्रकार, Learning Programmes and Academic Credits / अधिगम कार्यक्रम और अकादमिक क्रेडिट, Professional, Technical and Skill-Based Education / व्यावसायिक, तकनीकी और कौशल आधारित शिक्षा, Value Education and Environmental Education / मूल्य शिक्षा और पर्यावरण शिक्षा, Governance, Administration and Financing / शासन, प्रशासन और वित्तपोषण, Regulation, Accreditation and Ranking / उच्च शिक्षा का नियमन, प्रत्यायन और रैंकिंग
  12. Paper 2 | Unit 1 | Discrete Structures and Optimization: Propositional and Predicate Logic, Set Theory, Relations, Functions, Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Graph Theory, Group Theory, Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Optimization, Markov Chains
  13. Paper 2 | Unit 2 | Computer System Architecture: Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Basics of COA, Register Transfer and Microoperations, Programming the Basic Computer, Instr Formats & Modes, Control Unit Design, Pipelining, Input Output Organisation, Cache Memory Organization, Multiprocessors
  14. Paper 2 | Unit 3 | Programming Languages and Computer Graphics: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, HTML Basics, XML, JavaScript-Basics, Java, Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, OOPS with C++, Java Fundamentals, Array, String, IO & References, OOPS with Java
  15. Paper 2 | Unit 4 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  16. Paper 2 | Unit 5 | System Software and Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  17. Paper 2 | Unit 6 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  18. Paper 2 | Unit 7 | Data Structures and Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  19. Paper 2 | Unit 8 | Theory of Computation and Compilers: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  20. Paper 2 | Unit 9 | Data Communication and Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cloud Computing, Mobile Computing
  21. Paper 2 | Unit 10 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  22. Live Classes: NTA UGC NET 2025 Live Class
  23. Paper 1 | Full Mock Tests:
  24. Paper 2 | Full Mock Tests:
  25. Paper 1 | Previous Year Papers:
  26. Paper 2 | Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture provides a comprehensive walkthrough of Radix Sort implemented using Counting Sort as the underlying subroutine. The instructor begins by defining Radix Sort as a non-comparison based sorting algorithm that processes elements digit by digit, specifically from the Least Significant Digit (LSD) to the Most Significant Digit (MSD). The core concept relies on the stability of Counting Sort, ensuring that elements with equal keys maintain their relative order during intermediate passes. The demonstration utilizes a sample array of eight integers, such as 178, 002, 169, and 314, to illustrate the mechanics of sorting. The radix is established as 10 for decimal numbers, meaning digits range from 0 to 9. The instructor visually constructs an auxiliary counting array 'C' initialized with zeros, which is then populated by iterating through the input array to count the frequency of each digit at the current position being processed. The lecture progresses through multiple passes, first sorting by the ones place (LSD), then the tens place, and finally the hundreds place. In each pass, the counting array is modified to store cumulative counts, which determines the correct position of elements in a temporary output array 'b'. The video concludes by deriving the time complexity as O(dn), where d is the number of digits and n is the array size, and space complexity as O(n+k), simplifying to O(n) when radix is treated as a constant.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture opens with an introduction to Radix Sort using Counting Sort, explicitly labeled on screen as a 'Non Comparison Based Sorting Algorithm'. The instructor defines the sorting strategy as processing digits from the Least Significant Digit (LSD) to the Most Significant Digit (MSD). A sample array 'a' is displayed containing eight integers: 178, 002, 169, 314, 521, 738, 142, and 194. The digit range is identified as 0-9 with a radix of 10, setting the stage for the decimal sorting demonstration. The instructor emphasizes that Counting Sort serves as a stable subroutine at each digit position.

  2. 2:00 – 5:00 02:00-05:00

    The instructor begins the practical demonstration by initializing an auxiliary counting array 'C' with zeros. The focus shifts to processing the Least Significant Digit (LSD), which corresponds to the ones place of each number in array 'a'. The instructor underlines specific digits, such as the 8 in 178 and the 2 in 002, to indicate which position is currently being sorted. The counting array 'C' starts empty and begins to be populated with frequencies corresponding to the last digits of the numbers. The visual setup clearly distinguishes between the input array 'a' and the auxiliary counting structure required for the algorithm.

  3. 5:00 – 10:00 05:00-10:00

    The process of populating the counting array 'C' continues as the instructor iterates through every element in the input array. For each number, the last digit is extracted and used as an index to increment the value in array 'C'. For example, if a number ends in 2, the count at index 2 of 'C' is incremented. The on-screen text confirms that digits range from 0-9 and the radix remains 10. The instructor demonstrates how to map input numbers to their respective digit counts, building the frequency distribution necessary for the next step of determining positions. The array 'C' transitions from all zeros to a populated state reflecting the distribution of ones digits.

  4. 10:00 – 15:00 10:00-15:00

    The instructor modifies the counting array 'C' to store cumulative counts, a critical step for stable sorting. This transformation allows the algorithm to determine the final position of each element in the output array 'b'. The video shows arrows indicating the mapping from input numbers to their sorted positions based on the cumulative counts. Elements like 142 and 194 are placed into the output array 'b' based on their ones digit. The text on screen highlights that Counting Sort is used as a stable sorting algorithm at each digit position, ensuring the relative order of elements with identical digits is preserved during this pass.

  5. 15:00 – 20:00 15:00-20:00

    The first pass of sorting is completed, and the instructor prepares for the next iteration by processing the tens place. The data from the temporary output array 'b' is copied back into the source array 'a', effectively updating the input for the next digit position. The counting sort array 'c' is re-initialized to zeros, and the process repeats for the second least significant digit. The instructor demonstrates how the array evolves after sorting by the ones place, showing intermediate states where numbers are partially ordered. This step-by-step progression highlights the iterative nature of Radix Sort, moving systematically from LSD to MSD.

  6. 20:00 – 25:00 20:00-25:00

    The sorting process continues with the tens place digit. The instructor applies Counting Sort logic again, this time extracting the middle digit of each number (e.g., 7 from 178, 0 from 002). The counting array 'c' is populated with frequencies of these tens digits, and cumulative sums are calculated to determine positions in the output array. The visual evidence shows intermediate arrays labeled 'a', 'c', and a sorted version, illustrating the stability of the sort. The instructor tracks index positions 0-9 for digit buckets, ensuring that elements are placed correctly relative to their tens digit values.

  7. 25:00 – 30:00 25:00-30:00

    The final pass of the sorting algorithm is executed, focusing on the Most Significant Digit (MSD), which corresponds to the hundreds place. The instructor demonstrates how the array is sorted based on these leading digits, completing the Radix Sort process. The final output array 'b' is shown with numbers in fully ascending order, confirming the correctness of the algorithm. The visual progression from unsorted to sorted is clear, with intermediate arrays showing the state after each digit pass. The instructor emphasizes that this method works for any number of digits, provided the counting sort subroutine is applied correctly at each stage.

  8. 30:00 – 31:56 30:00-31:56

    The lecture concludes with an analysis of the time and space complexity. The instructor writes the formula O(dn) for time complexity, defining 'd' as the number of digits in each element and 'n' as the total number of elements. Space complexity is derived as O(n+k), where k represents the radix (10 in this case). The instructor notes that since the radix is a constant, the space complexity simplifies to O(n). The final frames show the sorted array 'a' with indices 1-8, alongside the counting array 'c', reinforcing the relationship between the algorithm's structure and its efficiency metrics.

The lecture effectively bridges theoretical concepts with practical implementation by using a concrete example of sorting eight integers. The key takeaway is the iterative application of Counting Sort, which acts as a stable subroutine to sort digits from LSD to MSD. The stability of Counting Sort is crucial; without it, the relative order established in previous passes would be lost. The visual aids, including underlined digits and evolving arrays 'a', 'b', and 'c', provide clear evidence of the algorithm's mechanics. The complexity analysis at the end solidifies understanding by quantifying performance in terms of digits and array size. This approach demonstrates why Radix Sort is efficient for large datasets with fixed-length keys, avoiding the O(n log n) lower bound of comparison-based sorts.

Loading lesson…