Loops Time Complexity - 4

Duration: 16 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/algorithms/time-complexity-analysis/iterative-loops-code/asset-loops-time-complexity-4 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 complexity of for loops where the iterator variable is multiplied by a constant factor in each iteration, resulting in logarithmic time complexity. The instructor systematically breaks down the execution flow of loops with multiplicative increments, such as i = i * 2 and i = i * 7. By tracing the values of the iterator variable as powers of the multiplier (e.g., 1, 2, 4, 8... or 1, 7, 49...), the instructor establishes a geometric progression. The core method involves setting up an inequality where the final value of i is less than or equal to n (e.g., 2^k <= n), solving for the number of iterations k using logarithms, and concluding that the time complexity is O(log n). The lecture emphasizes the mathematical derivation of loop termination conditions and demonstrates how different multipliers affect the base of the logarithm while maintaining the same asymptotic complexity class.

Chapters

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

    The instructor introduces the analysis of a for loop with multiplicative increment, specifically i = i * 2. Visible on screen is the code snippet '7. for(i = 1; i <= n; i = i * 2)'. The instructor initializes the variable i to 1 and writes down the loop condition '1 <= n' to begin determining the number of executions. This initial setup establishes the foundation for analyzing how the iterator grows exponentially rather than linearly, marking the start of a derivation that will lead to logarithmic complexity.

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

    The instructor traces the execution steps of the loop, writing out the values of i as powers of 2: 'i = 1', 'i = 2', 'i = 2^2', and 'i = 2^3'. The whiteboard shows a sequence of boolean checks against n, such as '1 <= n ? True -> 1' and '2 <= n ? True -> 3'. This visual mapping demonstrates the geometric progression of the iterator variable, illustrating how each iteration doubles the previous value. The instructor marks 'True' conditions to count iterations, reinforcing the concept that the loop continues as long as the current power of 2 remains less than or equal to n.

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

    The instructor formalizes the termination condition by setting '2^k <= n' and solving for k using logarithms. The derivation shows steps like '$\log_2 i^k \le \log_2 n$' leading to 'k <= log2 n'. The instructor notes that the loop runs '(k+1) Times', accounting for the initial iteration. This section transitions from tracing specific values to a general algebraic proof, demonstrating that the number of iterations is proportional to the logarithm of n. The visual evidence includes the inequality setup and the final conclusion that the complexity is O(log n).

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

    The lecture shifts to a new example with the loop '8. for(i = 1; i <= n; i = i * 7)'. The instructor writes the sequence of values 'i = 7^0', 'i = 7^1', 'i = 7^2' to show the geometric progression with a base of 7. The derivation follows the same pattern as before, setting up '7^k <= n' and applying logarithms to solve for k. The instructor highlights that the number of iterations is determined by 'floor(log_7(n)) + 1'. This comparison reinforces that while the base of the logarithm changes with the multiplier, the asymptotic complexity remains O(log n).

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

    The instructor concludes the analysis of the i = i * 7 loop by finalizing the inequality '7^k <= n' and solving for k. The whiteboard displays the final complexity result as 'Time = floor(log_7(n)) + 1' which simplifies to '= O(log n)'. This final step confirms that loops with multiplicative increments always exhibit logarithmic time complexity regardless of the specific multiplier used. The instructor emphasizes that the base of the logarithm is determined by the multiplication factor, but Big-O notation abstracts away constant factors.

The lecture provides a rigorous mathematical derivation for determining the time complexity of loops with multiplicative increments. The central concept is that when an iterator variable i starts at 1 and is multiplied by a constant c in each iteration (i = i * c), the value of i grows exponentially as c^0, c^1, c^2... The loop terminates when c^k > n. By solving the inequality c^k <= n for k, we find that k is proportional to log_c(n). Since Big-O notation ignores constant factors and base changes in logarithms, the time complexity is universally O(log n). The instructor uses two distinct examples (c=2 and c=7) to demonstrate that the specific multiplier only changes the base of the logarithm, not the asymptotic growth rate. This method of tracing values to powers and solving inequalities is a standard technique for analyzing non-linear loop progressions.

Loading lesson…