Lecture

Searching Algorithms: Linear and Binary Search

In course

Proident duis aute voluptate non occaecat labore adipisicing. Ex consequat minim minim veniam eiusmod cupidatat adipisicing culpa laboris veniam. Enim cupidatat minim officia et. Laboris mollit occaecat laboris dolore excepteur esse anim sunt ea quis cillum tempor officia duis.

Description

This lecture covers the linear search algorithm, which locates an item in a list by examining elements one at a time, and the binary search algorithm, which is more efficient but requires sorting. Examples and procedures are provided to illustrate these searching algorithms.

Official source

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

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Analysis of algorithms

Related lectures (27)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.