Selection Sort

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/algorithms/sorting-algorithms/selection-sort/asset-selection-sort after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: 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
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
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…