Binary Search: Basics and Execution

In course

Description

This lecture covers the fundamental concept of binary search, which is essential for many algorithms. It explains the process of searching for an item in both unordered and ordered lists, highlighting the differences in time complexity. The instructor demonstrates the step-by-step execution of the binary search algorithm, emphasizing its efficiency in comparison to linear search. Additionally, the lecture discusses the temporal complexity of the algorithm, showcasing how the size of the list is halved at each step.

In MOOCs (2)

Instructors (3)

Official source

https://mediaspace.epfl.ch/media/0_3nmdph3y

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (174)

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

Delves into algorithm complexity, analyzing search efficiency and operation count, with a focus on worst-case scenarios and 'big O' notation.

Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Explores induction, recursion, and sorting algorithms, including merge sort and the proof of correctness for recursive algorithms.

Related concepts (42)

Time complexity

In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor.

Binary search tree

In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. The time complexity of operations on the binary search tree is directly proportional to the height of the tree. Binary search trees allow binary search for fast lookup, addition, and removal of data items.

Complexity class

In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.

P (complexity)

In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time. Cobham's thesis holds that P is the class of computational problems that are "efficiently solvable" or "tractable". This is inexact: in practice, some problems not known to be in P have practical solutions, and some that are in P do not, but this is a useful rule of thumb.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.