Recurrence Relation - 14

Duration: 17 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/algorithms/time-complexity-analysis/substitution-method/asset-recurrence-relation-14 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 solving a specific recurrence relation problem to determine its time complexity. The instructor introduces the problem Q14, which defines T(n) with a base case for n <= 2 and a recursive step involving square roots: T(n) = sqrt(n)T(sqrt(n)) + n for n > 2. The core teaching method involves transforming the recurrence using variable substitution and iterative expansion to reveal a pattern. Key steps include converting radical notation to exponential form (n^(1/2)), substituting variables to simplify the nested structure, and determining the number of iterations k required to reach the base case. The solution culminates in deriving a time complexity of O(n log log n) by analyzing the logarithmic relationship between n and k.

Chapters

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

    The instructor introduces Problem Q14, asking for the time complexity of a recurrence relation defined as T(n) = 1 if n <= 2, and sqrt(n)T(sqrt(n)) + n if n > 2. He uses his pen to point at the base case and the recursive step, emphasizing the square root operation. The visual focus remains on the mathematical definition as he begins to explain the problem structure, highlighting the condition n > 2 and the recursive term involving T(sqrt(n)).

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

    The instructor begins solving the recurrence by rewriting sqrt(n) as n^(1/2). He substitutes this exponential form into the original equation, transforming T(n) = sqrt(n)T(sqrt(n)) + n into T(n) = n^(1/2)T(n^(1/2)) + n. He then performs variable substitution, replacing T(n) with a function of m where n is related to m. The process involves algebraic manipulation to transform the recurrence into a more solvable form, specifically showing steps like T(m) = m^(1/2)T(n^(1/8)) + n and simplifying exponents.

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

    The instructor expands the recursive term T(n^(1/2)) by plugging in the original recurrence definition again. He demonstrates algebraic simplification of exponents, such as n^(1/2) * n^(1/4) = n^(3/4), to break down the nested square root structure. He continues iterating the substitution, showing that n^(3/8) * n^(1/8) equals n^(1/2). The process involves writing the general form after k iterations, circling exponent addition for emphasis to show how the terms combine.

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

    The instructor derives the value of k by setting up an inequality for the base case: n^(1/2^k) <= 2. He applies logarithms to both sides, simplifying (1/2^k) log n <= 1 to find that k >= log log n. He substitutes this value of k back into the recurrence relation, showing T(n) = n^(1/2^k)T(n^(1/2^k)) + kn. The derivation involves manipulating exponents and logarithms to isolate k, connecting the iteration count to the final complexity.

  5. 15:00 – 17:16 15:00-17:16

    The instructor concludes the solution by demonstrating the substitution method with multiple expansions of T(n) = n^(1/2)T(n^(1/2)) + n. He derives the value of k for the base case as k = floor(log_2 log_2 n). By substituting values to find the time complexity, he confirms that T(n) = n log log n. The final steps involve simplifying exponents and finding the iteration count k, solidifying the result for the recurrence relation.

The lecture provides a detailed walkthrough of solving a recurrence relation using the substitution method. The problem T(n) = sqrt(n)T(sqrt(n)) + n is transformed by converting radicals to exponents, allowing for iterative expansion. The instructor systematically expands the recurrence k times, tracking how coefficients and arguments change. A critical step involves determining the number of iterations k needed to reach the base case n <= 2, which is solved using logarithms to yield k = log log n. The final complexity O(n log log n) is derived by summing the contributions of each iteration, demonstrating how nested square roots reduce the problem size logarithmically rather than linearly.

Loading lesson…