Lecture

Randomized Algorithms: Median Search

Description

This lecture focuses on the use of randomness combined with recursion to efficiently search for the median of a list. The instructor explains the concept of median, the importance of choosing a pivot element, and the algorithm's complexity. By randomly selecting pivots, the algorithm can achieve a linear time complexity, making it a powerful tool for median search.

Official source

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

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

Theory of computation: Computational complexity theory

Related lectures (26)

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.