Loops Time Complexity - 5
Duration: 17 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks: Introduction to CN, Data Communication, 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- DBMS: 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, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture segment focuses on deriving the time complexity of for loops where the iterator is divided by a constant factor in each iteration. The instructor systematically analyzes two specific loop structures: one where the iterator `i` is halved (`i = i / 2`) and another where it is divided by seven (`i = i / 7`). The core pedagogical method involves tracing the sequence of values for `i` across iterations, establishing a mathematical inequality to determine when the loop terminates (when `i < 1`), and solving for the number of iterations using logarithms. The analysis demonstrates that dividing a variable by a constant factor results in logarithmic time complexity, specifically O(log n). The instructor writes out the sequence of values (n, n/2, n/4...), sets up the condition `n / 2^k >= 1`, and solves for k to show that the number of iterations is proportional to log base 2 of n. This pattern is then generalized for division by other constants, such as 7, confirming that the base of the logarithm changes but the complexity class remains O(log n).
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the first problem, a for loop where the iterator `i` starts at `n`, continues while `i >= 1`, and is halved in each iteration (`i = i / 2`). He begins the analysis by writing the loop structure on the board: `for(i = n; i >= 1; i = i / 2)`. He establishes the initial state by setting `i` to `n` and noting that the condition `n >= 1` must hold true for the loop to execute. This sets up the base case for determining how many times the loop will run before `i` drops below 1.
2:00 – 5:00 02:00-05:00
The instructor traces the sequence of values for `i` to visualize the loop's progression. He writes down the first few iterations: `n`, then `n/2`, and subsequently `n/4` (or `n/2^2`). He explicitly checks the loop condition for each step, writing inequalities like `n >= 1`, `n/2 >= 1`, and `n/4 >= 1` to verify that the loop continues. This step-by-step substitution illustrates how the variable decreases exponentially, which is a key concept in identifying logarithmic behavior. The instructor writes `n/2^k` to represent the value of `i` after k iterations.
5:00 – 10:00 05:00-10:00
The instructor formalizes the termination condition by setting up an inequality to solve for the number of iterations `k`. He writes that the loop runs as long as `n / 2^k >= 1`, which implies `n >= 2^k`. He explains that the total number of iterations is `(k+1) Times` because the loop runs for `i = n/2^0` through `n/2^k`. To find the exact value of k, he applies logarithms to both sides of the inequality `n >= 2^k`, resulting in `log n >= k log 2`. This mathematical derivation is crucial for converting the exponential reduction into a logarithmic complexity measure.
10:00 – 15:00 10:00-15:00
The instructor transitions to a second example where the iterator is divided by 7 instead of 2. He writes the new loop structure: `for(i = n; i >= 1; i = i / 7)`. He repeats the same analytical process, writing the sequence of values `n`, `n/7`, and `n/49` (or `n/7^2`). He sets up the termination inequality `n / 7^k >= 1`, which leads to `n >= 7^k`. He solves for k by taking the logarithm base 7, deriving that `k <= log_7 n`. This demonstrates that changing the divisor changes the base of the logarithm but not the fundamental complexity class.
15:00 – 17:09 15:00-17:09
The instructor concludes the analysis by summarizing the time complexity for both examples. For the loop divided by 2, he confirms the complexity is O(log n). For the loop divided by 7, he writes `Time Complexity = O(log n)` on the board, noting that while the base is 7, it is still logarithmic. He emphasizes that the number of iterations is `(r+1) Times` where r is derived from `n >= 7^r`. The final takeaway is that any loop dividing the iterator by a constant factor results in logarithmic time complexity, regardless of the specific divisor used.
The lecture provides a rigorous mathematical derivation for determining the time complexity of loops with geometric progression in their iterator. The instructor's method is consistent across examples: first, trace the variable values to identify the pattern (n, n/c, n/c^2...); second, establish the termination inequality (n/c^k >= 1); third, solve for k using logarithms. The key insight is that the number of iterations k satisfies `c^k <= n`, which implies `k <= log_c(n)`. Since the base of a logarithm only introduces a constant factor difference (log_a n = log_b n / log_b a), the Big-O notation simplifies to O(log n) for any constant divisor c > 1. This confirms that halving or dividing by any fixed integer results in logarithmic time complexity, a fundamental concept for analyzing algorithms like binary search or recursive divide-and-conquer strategies.

