Lecture

Quicksort: Expected Running Time and Decision Tree

In course

Culpa eiusmod dolore anim laboris velit culpa occaecat ut anim dolor consectetur. Officia aute est anim excepteur ipsum sint consequat tempor aliqua. Deserunt Lorem minim nulla non minim ex incididunt eiusmod eiusmod commodo culpa. Eiusmod do duis est incididunt pariatur duis elit nulla magna do ut amet ea.

Description

This lecture covers the expected running time of randomized quicksort, which is O(n log n) for any input. The algorithm is in-place, efficient, and easy to implement. It also discusses decision trees as an abstraction of comparison sorts, representing comparisons made by sorting algorithms on inputs of a given size.

Instructors (2)

adipisicing sint magna non

Laboris cillum velit quis cillum ullamco magna mollit excepteur sint sint. Anim dolore occaecat est irure veniam ad ipsum in qui commodo sunt reprehenderit. Pariatur dolore veniam quis aliquip eiusmod anim dolor eiusmod qui.

officia adipisicing exercitation duis

Duis occaecat nulla cupidatat officia dolore quis nostrud dolor adipisicing duis aute fugiat. Dolor duis cupidatat minim consequat anim aliquip irure aliqua velit laborum est sit mollit ea. Est eu labore mollit fugiat aliqua in nisi ex. Do non laboris cupidatat incididunt occaecat laboris sit sunt cillum do id duis laboris.

Official source

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

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 (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.