Lectures related to Linear search

Recursive Algorithms: Factorial, Exponentiation, Search

Explains recursive algorithms for factorial, exponentiation, and search problems.

Gossip Efficiency: Decentralized Systems

Explores gossip efficiency in decentralized systems, covering protocols, interaction needs, and bandwidth optimization, along with search algorithms and optimizations.

Complexity of Algorithms: Growth and Laws

Covers the growth of functions and time complexity analysis for search algorithms.

Algorithms: Summary of the week

Covers algorithms for searching, sorting, optimization, and the Halting Problem.

Introduction to Logarithm

Covers the introduction to logarithms, algorithmic notations, and analysis of algorithm travel times.

Shortest Path Algorithms

Explores solving various problems as shortest path problems, including the Rubik's Cube and speech recognition.

Quasi-newton optimization

Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.

Searching Algorithms: Linear and Binary Search

Covers linear and binary search algorithms for locating items in lists.

Searching Algorithms: Linear and Binary Search

Covers linear and binary search algorithms for locating items in a list.

Algorithm Analysis: Growth, Search, and Logarithm

Explores algorithm growth, search complexities, and logarithmic properties in depth, with practical exercises included.

Recursive Algorithms: Induction and Recursion

Introduces recursive algorithms for factorial, exponentiation, and search.

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Complexity of Algorithms

Explores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.

Complexity & Induction: Algorithms & Proofs

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Algorithm Complexity Analyses

Covers the complexity analyses of algorithms and their worst-case time complexities.

Momentum methods and nonlinear CG

Explores gradient descent with memory, momentum methods, conjugate gradients, and nonlinear CG on manifolds.

Complexity Analyses: Linear and Binary Search, Sorting Algorithms

Covers the complexity analyses of search and sorting algorithms.

Hash Functions and Tables

Introduces hashing tables, including the Birthday Lemma, Direct-Address Tables, collisions, and Chained-Hash-Search.

Algorithms in Computer Science: Search and Sort Techniques

Provides an overview of essential search and sort algorithms in computer science.

Protein Design: Computational Methods

Covers challenges in protein design, energy functions, search algorithms, and applications in synthetic biology, emphasizing the importance of protein design and the methods used for designing proteins.