Loops Time Complexity - 5

Duration: 17 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/algorithms/time-complexity-analysis/iterative-loops-code/asset-loops-time-complexity-5 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, Logarithm, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, प्रतिशत / Percentage, औसत / Average, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, Statistics, Probability, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समय और कार्य / Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Paper-1 & 2 | Data Interpretation: आँकड़ा निर्वचन / Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, Data Sufficiency, अशाब्दिक तर्क / Non-Verbal Reasoning, Syllogisms, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, Analytical Reasoning (Counting Figures Reasoning), गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Data Arrangement, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: आँकड़ों की पर्याप्तता एवं निर्णय क्षमता / Data Sufficiency and Decision Making
  7. Paper-1 | General Science: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, समसामयिकी / Current Affairs
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection, कंप्यूटर नेटवर्क / Computer Networks
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy: वृद्धि और विकास / Growth and Development, Concept of Pedagogy, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, विकास के सिद्धांत / Theories of Development, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
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

  1. 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. 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.

  3. 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.

  4. 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.

  5. 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.

Loading lesson…