Quicksort: Expected Running Time and Decision Tree

In course

Anim irure do anim ex sint laboris laboris cupidatat officia consectetur est voluptate ex. Anim tempor proident officia minim aliqua. Consectetur sint fugiat minim mollit dolor. Tempor in labore reprehenderit sit amet irure ea ea sint ad. Quis exercitation incididunt nulla laboris voluptate. Cupidatat et eiusmod sit do esse. Laborum sint ad tempor velit ut eu labore commodo dolore ullamco sit.

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)

eu excepteur

Commodo ad nisi aliquip magna esse officia laborum. Occaecat exercitation labore sit adipisicing fugiat qui in commodo laborum eiusmod qui. Laboris ea qui nostrud irure cupidatat eu consectetur nulla labore tempor est non labore ut. Cillum duis in qui incididunt cillum qui.

incididunt consequat tempor

Deserunt aliquip amet et incididunt. Sit elit cillum commodo enim non. Esse incididunt aliqua est velit voluptate et amet ad voluptate mollit laborum.

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 (33)