Skip to main content
Graph
Search
fr
|
en
Switch to dark mode
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Time complexity
Formal sciences
Theoretical computer science
Theory of computation
Computational complexity th...
Related lectures (29)
Graph Chatbot
Login to filter by course
Login to filter by course
Reset
Previous
Page 3 of 3
Next
Modular Arithmetic: Exponentiation Optimization
Explores optimizing exponentiation in modular arithmetic for efficient calculations and prime number determination.
Binary Search Trees: Operations and Implementations
Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.
Search Algorithms: Linear vs Logarithmic
Illustrates the efficiency of logarithmic search algorithms over linear ones, emphasizing the importance of data modeling and the trade-off between sorting and searching costs.
Card Shuffling Models
Explores models of card shuffling, state spaces, and time complexity.
Algorithm Design: Time Complexity Analysis
Introduces algorithm design and time complexity analysis using examples and notations like n² and O(n).
Introduction to Conditional Statements
In this lecture, you will learn to use conditional statements in Scratch to create interactive programs.
Complexity of Algorithms: Growth of Functions
Analyzes the growth of functions to understand algorithm complexity and efficiency.
Complexity of Algorithms
Covers the Big-O notation to analyze algorithm efficiency and provides examples of polynomial and factorial function estimates.
Complexity of Algorithms: Proofs of Big-O
Covers proofs of Big-O using witnesses and rules to analyze algorithm complexity.
