Recurrence Relation - 6

Duration: 18 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/algorithms/time-complexity-analysis/substitution-method/asset-recurrence-relation-6 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 segment focuses on analyzing the time and space complexity of a recursive algorithm using recurrence relations and recursion trees. The instructor begins by presenting pseudocode for a function rec(n) that makes three recursive calls with input n/3, plus a linear term. The core pedagogical flow involves translating this code into a mathematical recurrence relation, solving it via the substitution method to find time complexity, and then analyzing space complexity using a recursion tree. Key concepts include identifying base cases versus recursive steps, setting up recurrence equations like T(n) = 3T(n/3) + O(1), expanding terms iteratively to find patterns, and solving for the depth k using logarithms. The instructor demonstrates algebraic simplification of geometric series to derive Theta(n) for time complexity and O(log n) for space complexity. The session emphasizes the connection between algorithmic structure (three branches of size n/3) and mathematical growth rates.

Chapters

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

    The instructor introduces Question 6, displaying pseudocode for a recursive function rec(n) on screen. The code includes a base case condition (n == 1) returning 1, and an else block containing three recursive calls to rec(n/3) plus a linear term n. The instructor points specifically to the base case and the recursive step, highlighting the structure of the algorithm. On-screen text explicitly asks for the time and space complexity of this specific recursive algorithm, setting the stage for mathematical analysis. The instructor underlines the three calls to rec(n/3) and the linear term n, indicating these are critical components for deriving the recurrence relation.

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

    The instructor begins translating the algorithm into a recurrence relation for time complexity. He writes T(n) = 1 for the base case where n equals 1, and starts formulating the recursive step. The screen shows T(n) = { 1 if n=1, 3T(n/3)+O(1) if n>1 }. The instructor writes T(n) = 3T(n/3) + 1, explicitly identifying the three recursive calls as contributing to the coefficient of T(n/3). He underlines the recursive calls in the code again while writing the equation, reinforcing the link between code logic and mathematical notation. This section establishes the foundational recurrence relation T(n) = 3T(n/3) + O(1) that will be solved in subsequent steps.

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

    The instructor applies the substitution method to solve the recurrence relation T(n) = 3T(n/3) + 1. He expands the term iteratively, writing T(n/3) = 3T(n/9) + 1 and substituting it back into the main equation. The screen displays the expansion steps: T(n) = 3[3T(n/3^2)] + 1, which simplifies to 3^2 T(n/3^2) + 3 + 1. He continues this process to k iterations, showing the general form T(n) = 3^k T(n/3^k) + 3^(k-1) + ... + 1. The instructor points to the summation series and writes out the pattern of coefficients accumulating, demonstrating how the recursive structure translates into a geometric progression. This iterative expansion is crucial for identifying the closed-form solution.

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

    The instructor determines the value of k by setting the base case condition n/3^k = 1, which implies n = 3^k. He derives k = log_3(n) by taking the logarithm base 3 of both sides. Substituting this value back into the expanded summation formula, he simplifies the expression 3^k T(n/3^k) + 3^(k-1) + ... + 3^0. The screen shows the geometric series summation formula being applied: (3^(k+1) - 1) / (3-1). Through algebraic simplification, he concludes that the total time complexity is Theta(n), noting that 3^k equals n. This section bridges the gap between iterative expansion and final Big Theta notation, confirming linear time complexity.

  5. 15:00 – 18:08 15:00-18:08

    The instructor transitions to analyzing space complexity using a recursion tree diagram. He draws the tree structure where rec(n) branches into three calls of rec(n/3). He calculates the height of the tree by solving m / 3^k = 1, finding k = log_3(n). The screen displays the summation of work at each level: 3^0 + 3^1 + ... + 3^k. He explains that the space complexity is determined by the maximum depth of the recursion stack, which corresponds to the height k. Concluding the analysis, he writes Space complexity = O(log n), distinguishing it from the time complexity derived earlier. This final section emphasizes that while time complexity is linear due to total work, space complexity depends on the recursion depth.

The lecture systematically guides students through the complexity analysis of a divide-and-conquer recursive algorithm. The instructor first establishes the recurrence relation T(n) = 3T(n/3) + O(1) from the pseudocode, emphasizing the three recursive calls and linear overhead. Using the substitution method, he expands the relation iteratively to reveal a geometric series pattern, then solves for k using logarithmic properties. The algebraic simplification of the summation leads to a Theta(n) time complexity, demonstrating that the total work grows linearly despite multiple recursive branches. The space complexity analysis shifts focus to recursion depth, using a tree diagram to show that the stack height is log_3(n), resulting in O(log n) space. This progression from code to recurrence, then to iterative expansion and finally to closed-form solutions, provides a comprehensive framework for analyzing recursive algorithms. The distinction between time (total operations) and space (stack depth) is clearly articulated through separate derivations.

Loading lesson…