Insertion Sort

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/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. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…