Selection Sort

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-data-structures/sorting-algorithms/selection-sort/asset-selection-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.

This lecture introduces selection sort as an internal comparison sorting algorithm with O(n^2) time complexity. The instructor presents the pseudocode, which uses an outer loop variable k from 1 to n-1 and an inner loop j from k+1 to n. A sample array, initially shown as 20, 40, 60, 10, 20, and 50 in one window but later appearing as 20, 40, 60, 10, 30, and 50 in another, is used to trace execution. The first pass initializes min = A[1] and Loc = 1, then compares min against later elements. When a smaller value is found, such as 10 at index 4, min and Loc are updated. The pass ends by swapping A[k] with A[Loc], placing the smallest unsorted element at position 1. The second pass begins with k = 2, again scanning the unsorted portion to find the minimum and prepare a swap. The lesson emphasizes that although selection sort is slower than insertion sort on large lists, its simplicity can be advantageous in some contexts.

Chapters

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

    The video opens by defining selection sort as an internal comparison sorting algorithm with O(n^2) time complexity. The on-screen text notes that it performs worse than the similar insertion sort but is noted for its simplicity. The instructor displays the pseudocode, including Selection Sort (A, n), for k <- 1 to n-1, min = A[k], Loc = k, and the inner loop for j <- k+1 to n. A sample array is introduced, with values such as 20, 40, 60, 10, 20, and 50 shown in the sampled frames. The outer loop variable k is annotated as taking values from 1 to n-1, setting up the step-by-step trace.

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

    The instructor traces the first iteration of selection sort on the six-element array. The board shows min = 20 and Loc = 1, with j listed as 2, 3, 4, 5, and 6. The first comparison written is 20 > 40, which evaluates to false, so min and Loc remain unchanged. As the inner loop continues, a smaller element is found: 20 > 10 becomes true, updating min to 10 and Loc to 4. The array state is then updated by swapping A[1] with A[4], placing 10 at the first position. The pseudocode line swap(A[k], A[Loc]) is highlighted to show how the pass completes.

  3. 5:00 – 9:24 05:00-09:24

    The lecture moves to the second iteration of the outer loop, where k = 2. The instructor again initializes min and Loc to the current element at position 2, then scans the remaining unsorted portion using j from k+1 to n. Comparisons are made between min and later elements, with red annotations tracking the values of k, min, and Loc. The new minimum is identified at index 4 with a value of 20 in the sampled frames, and a swap between A[k] and A[Loc] is indicated. Crossed-out numbers in the array mark elements already placed in sorted order, reinforcing that each pass fixes one more position from left to right.

The central idea is that selection sort repeatedly finds the minimum element in the unsorted portion of an array and swaps it into place. The algorithm is simple: for each k from 1 to n-1, set min = A[k] and Loc = k; then for each j from k+1 to n, if min > A[j], update min = A[j] and Loc = j; finally swap A[k] with A[Loc]. The worked example demonstrates this process on a six-element array, showing how the first pass locates 10 at index 4 and swaps it to position 1, and how the second pass begins by scanning from k = 2. The O(n^2) complexity arises because each of the n-1 passes may scan up to n elements. The lecture also contrasts selection sort with insertion sort, noting that selection sort is generally slower on large lists but valued for its simplicity. A minor inconsistency appears in the sampled screenshots: one window shows the array as 20, 40, 60, 10, 20, and 50, while another shows 20, 40, 60, 10, 30, and 50. This may reflect a correction or a different example state, but the sorting logic remains consistent.

Loading lesson…