Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Linear search

Related lectures (26)

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.

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.

Complexity of Algorithms: Quiz + Answers

Covers the time complexity of algorithms and includes a quiz.

Search and Routing Protocols

Explores unstructured and structured search and routing protocols, emphasizing the importance of network structure assumptions and introducing the 'Bubble Storm' algorithm.

Optimal Binary Search Tree

Explores optimal binary search trees to minimize expected search cost efficiently.

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.