Insertion Sort

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-data-structures/sorting-algorithms/insertion-sort/asset-insertion-sort after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  19. Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing
  22. Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a comprehensive lecture on the Insertion Sort algorithm, designed to help students understand both the conceptual logic and the implementation details. It begins with a slide explaining that the algorithm iterates through input elements, growing a sorted output list one by one. The instructor emphasizes that this is an in-place sorting method. The lecture then transitions to a visual demonstration using a specific array, showing how elements are compared and shifted. Finally, the instructor presents the pseudocode, breaking down the loop structures and variable assignments, and performs a detailed trace on a numerical example to illustrate the algorithm's behavior step-by-step.

Chapters

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

    The lecture opens with a slide titled 'Insertion Sort' containing three bullet points. The first point states that insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. It explains that at each iteration, the algorithm removes one element from the input data, finds its location within the sorted list, and inserts it there. The second point notes that sorting is typically done in-place by iterating up the array. The third point details the comparison logic: if the new element is larger, it stays; if smaller, it finds the correct position by shifting larger values up to make space.

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

    The instructor demonstrates the algorithm using the array 6 5 3 1 8 7 2 4. Initially, 6 is the sorted portion. When 5 is processed, it is smaller than 6, so 6 shifts right and 5 inserts, resulting in 5 6. Next, 3 is processed; it is smaller than 6 and 5, so both shift right and 3 inserts at the start, making 3 5 6. Then 1 is processed; it is smaller than all existing elements, so 3, 5, 6 shift right and 1 inserts at the beginning, resulting in 1 3 5 6. The element 8 is larger than 6, so it remains in place, extending the sorted list to 1 3 5 6 8. Next, 7 is processed; it is smaller than 8 but larger than 6, so 8 shifts right and 7 inserts, resulting in 1 3 5 6 7 8. Then 2 is processed; it is smaller than all elements, so 8, 7, 6, 5, 3 shift right and 2 inserts at the beginning. Finally, 4 is processed; it is smaller than 8, 7, 6, 5 but larger than 3, so those four elements shift right and 4 inserts after 3, completing the sort.

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

    The instructor writes the pseudocode for Insertion sort (A, n). He defines the loop for j <- 2 to n. Inside, he sets key = A[j] and i = j - 1. The core logic is the while(i > 0 and A[i] > key) loop. Inside this loop, A[i+1] = A[i] shifts the element to the right, and i = i - 1 moves the index back. After the loop, A[i+1] = key places the key in its correct spot. He traces this with the array 40 30 50 10 10. For j=2 (key=30), i=1 (40). Since 40 > 30, 40 shifts to index 2, i becomes 0. Loop ends. A[1] becomes 30. Array: 30 40 50 10 10. For j=3 (key=50), i=2 (40). 40 < 50, loop doesn't run. A[3] becomes 50. Array: 30 40 50 10 10. For j=4 (key=10), i=3 (50). 50 > 10, shift. i=2 (40). 40 > 10, shift. i=1 (30). 30 > 10, shift. i=0. Loop ends. A[1] becomes 10. Array: 10 30 40 50 10. For j=5 (key=10), i=4 (50). 50 > 10, shift. i=3 (40). 40 > 10, shift. i=2 (30). 30 > 10, shift. i=1 (10). 10 > 10 is false. Loop ends. A[2] becomes 10. Array: 10 10 30 40 50.

  4. 10:00 – 10:02 10:00-10:02

    The video concludes with the final state of the array after the trace. The array is fully sorted as 10 10 30 40 50. The instructor has finished the step-by-step walkthrough of the pseudocode logic, showing how the algorithm handles duplicate values and ensures the array is sorted.

The video effectively bridges the gap between conceptual understanding and implementation. It starts with the high-level idea of growing a sorted list, moves to a concrete visual example to show the mechanics of shifting and insertion, and finally formalizes the process with pseudocode and a detailed trace. This progression helps students understand not just what the algorithm does, but how it manipulates data structures to achieve the sorted state. The use of both a simple visual array and a more complex pseudocode trace ensures a comprehensive understanding of the algorithm's mechanics.

Loading lesson…