Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Induction and Recursion: Examples + Q&A
Graph Chatbot
Related lectures (32)
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Complexity & Induction: Algorithms & Proofs
Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.
Algorithms Exam Preparation
Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample problems.
Binary Search: Basics and Execution
MOOC: Information, Computation, Communication: Introduction to computational thinking
Explores binary search fundamentals, efficiency, and temporal complexity in algorithmic searching.
Optimal Binary Search Tree
Explores optimal binary search trees to minimize expected search cost efficiently.
Proofs by Induction: Principles and Examples
Explains the induction principle and proofs by induction with examples like 1 + 3 + 5 + ... + (2n-1) = n².
Recursion and Binary Search
Introduces recursion and binary search algorithms for efficient problem-solving.
Binary Search Algorithm
Explains the binary search algorithm using two pointers to efficiently search a sorted list.
Binary Search Trees Operations
Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.
Binary Search Trees: Operations and Implementations
Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.
Data Structures: Stacks, Queues, Linked Lists
Covers stacks, queues, linked lists, and binary search trees in data structures.
Dynamic Programming: Palindromic Subsequences
Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.
Recursion and Induction: Understanding Mathematical Proofs
Explores recursion and induction for mathematical proofs through recursive algorithms and functions.
Binary Search: Implementation and Example
Covers the binary search algorithm and provides a step-by-step example.
Algorithms: Final Exam Review
Log in to Mediaspace to watch this video
Provides a detailed review of the 2016 final exam, covering various algorithmic problems.
Optimal Binary Search Trees
Log in to Mediaspace to watch this video
Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.
Encoder and Decoder for Prefix-Free Codes
Log in to Mediaspace to watch this video
Covers the implementation and verification of encoder and decoder for prefix-free codes, including classes and types, lemmas on trees, and the main theorem.
Longest Common Subsequence and Optimal BST
Log in to Mediaspace to watch this video
Explores Longest Common Subsequence and Optimal Binary Search Trees, discussing algorithms and probabilities for efficient search structures.
Binary Search Trees: Implementation and Operations
Log in to Mediaspace to watch this video
Covers the implementation and operations of basic data structures like stacks, queues, and linked lists, and introduces binary search trees.
Introduction to Logarithm
Log in to Mediaspace to watch this video
Covers the introduction to logarithms, algorithmic notations, and analysis of algorithm travel times.
Previous
Page 1 of 2
Next
