Searching Algorithms: Linear and Binary Search

Related lectures (23)

Page 1 of 3

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

Covers the basics of algorithms, the importance of studying them, data structures, and the impact of algorithms on various fields.

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

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

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

Covers the complexity analyses of search and sorting algorithms.

Explores binary search, merge sort, recursion in algorithms, Fibonacci numbers, and dynamic programming.

Introduces recursion and binary search algorithms for efficient problem-solving.

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

Explains binary search, the logarithm function, and recursive algorithms for factorial and Fibonacci sequences.