Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Iteration
Formal sciences
Theoretical computer science
Programming language theory
Formal semantics
Graph Chatbot
Related lectures (13)
Login to filter by course
Login to filter by course
Reset
Root Finding Methods: Secant and Newton's Methods
Covers numerical methods for root finding, focusing on the secant and Newton's methods.
Nested Loops: Star Patterns
Covers the implementation of nested loops in Python to create various star patterns.
Tower of Hanoi: Recursion and Dynamic Programming
Explores the Tower of Hanoi algorithm, recursion, and dynamic programming in solving problems efficiently.
Optimizing Recursive Queries
Explores optimizing recursive queries in database systems using Datalog and semirings, discussing the challenges and solutions in data analytics.
Recursion and Induction: Proving Algorithms Correctly
Explains recursion, induction, and proving algorithm correctness through mathematical induction.
Recursive Algorithms: Proving Correctness and Fibonacci Iteration
Explores recursion, induction, and the Fibonacci iteration algorithm.
Vectorization in Python: Efficient Computation with Numpy
Covers vectorization in Python using Numpy for efficient scientific computing, emphasizing the benefits of avoiding for loops and demonstrating practical applications.
Control Flow in Python: Conditional Statements and Loops
Covers control flow in Python, focusing on conditional statements and loops.
Numerical Methods: Bisection and Multidimensional Arrays
Discusses the bisection method for solving nonlinear equations and its implementation using Python with NumPy and Matplotlib.
Gradient Descent: Principles and Applications
Covers gradient descent, its principles, applications, and convergence rates in optimization for machine learning.
Recursive Algorithms: Divide and Conquer
Explores the concept of divide and conquer in recursive algorithms, exemplified by the Towers of Hanoi.
Tail Recursion
Covers tail recursion, optimizing functions in Scala for iterative processes and providing examples like tail-recursive factorial.
Recursion in Programming
Explores recursion in programming, discussing its benefits, challenges, and impact on algorithm complexity.
Previous
Page 1 of 1
Next