Recurrence Relation - 1

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/algorithms/time-complexity-analysis/substitution-method/asset-recurrence-relation-1 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 recurrence relations as a fundamental tool for analyzing the time complexity of recursive algorithms. The instructor explains that because recursive functions call themselves on smaller inputs, their performance cannot be calculated directly without first formulating a recurrence relation. The session outlines four primary methods for solving these relations: the Substitution Method, Recursion Tree Method, Master Method, and Change of Variables. The core of the lecture focuses on a practical application where the instructor analyzes a specific recursive function, rec(n), to demonstrate the Substitution Method. The analysis begins by defining T(n) as the running time of the function and establishing a recurrence relation based on the code's logic. The instructor then systematically expands T(n) by substituting terms iteratively, replacing T(n-1) with T(n-2) + 1, and continuing this process until the base case is reached. By identifying a pattern after k substitutions, specifically T(n-k) + k, the instructor solves for k when n-k equals 1. This leads to the final derivation of the time complexity as O(n). The lecture concludes by briefly transitioning to space complexity analysis, visualizing the recursion stack height.

Chapters

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

    The lecture begins with a definition of recurrence relations and their purpose in calculating the time complexity of recursive algorithms. The instructor explains that since these algorithms solve problems by calling themselves on smaller inputs, direct calculation is difficult without first writing and solving a recurrence relation. The slide explicitly lists four primary methods for solving recurrences: 1. Substitution Method, 2. Recursion Tree Method, and 3. Master Method. The instructor emphasizes the necessity of this mathematical approach to determine algorithmic efficiency.

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

    The instructor introduces a specific problem involving a recursive algorithm named rec(n) to demonstrate the Substitution Method. The code snippet on screen shows a function that returns 1 if n equals 1, otherwise it returns rec(n-1) plus n. The instructor defines T(n) as the running time of the function rec(n). He labels 'rec(n)' as the problem size to emphasize that n represents the input size. The focus is on translating the code logic into mathematical terms, specifically identifying the base case and the recursive step to set up the initial recurrence relation.

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

    The instructor formalizes the recurrence relation for the algorithm. He identifies the base case as T(1) = 1 and formulates the recursive step as T(n-1) + O(1). The slide displays the relation: T(n) = 1 if n=1, and T(n-1) + O(1) if n > 1. The instructor then begins the substitution process by expanding T(n) = T(n-1) + 1. He substitutes T(n-1) with T(n-2) + 1, and subsequently T(n-2) with T(n-3) + 1. This iterative expansion is shown on screen to demonstrate how terms accumulate, resulting in expressions like T(n-2) + 1 + 1 and T(n-3) + 1 + 1 + 1.

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

    Continuing the substitution method, the instructor generalizes the pattern observed in the previous steps. He writes T(n-k) + k to represent the state after k substitutions. To solve for the total complexity, he determines the value of k when the recursion reaches the base case. By setting n - k = 1, he solves for k to find that k = n - 1. Substituting this back into the general form yields T(1) + n - 1. Since T(1) is a constant, the final time complexity is derived as O(n). The instructor points to these equations on the board to reinforce the derivation steps.

  5. 15:00 – 19:27 15:00-19:27

    The instructor concludes the time complexity analysis and transitions to space complexity. He reiterates that the final result is O(n) based on the substitution method derivation. To analyze space complexity, he begins drawing a recursion stack to visualize the memory usage. The screen shows text indicating 'Space complexity = Rec(n) + Rec(n-1)...' and notes that the stack height is approximately n. This visual aid helps explain how the recursive calls consume memory proportional to the input size, linking the depth of recursion to space requirements.

The lecture provides a structured introduction to recurrence relations, emphasizing their role in analyzing recursive algorithms. The instructor moves from theoretical definitions to a concrete example using the Substitution Method. Key concepts include defining T(n) as running time, identifying base cases versus recursive steps, and iteratively expanding the recurrence to find a pattern. The derivation T(n) = T(n-1) + 1 leading to O(n) serves as a foundational example. The session also briefly touches on space complexity, using the recursion stack to illustrate memory consumption proportional to input size. This progression from definition to application ensures students understand both the mathematical formulation and practical implications of recurrence relations in algorithm analysis.

Loading lesson…