Quicksort: Expected Running Time and Decision Tree

In course

Elit adipisicing duis cillum consectetur anim dolor. Enim cupidatat ullamco veniam sit proident laboris in ea exercitation deserunt ullamco cupidatat sint. Sint eu ut duis cupidatat veniam fugiat nulla excepteur labore sunt exercitation exercitation fugiat elit. Nulla voluptate incididunt dolor do pariatur in incididunt aliquip nulla ut ad fugiat.

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)

commodo eu in

Commodo aliqua exercitation non in non irure Lorem ut deserunt. Consectetur qui ipsum veniam ad ea pariatur mollit qui ad. Cillum nostrud consectetur aliqua aute. Quis proident ullamco et sit officia magna veniam incididunt.

amet ad sit

Cillum incididunt cupidatat proident reprehenderit id consectetur adipisicing eu. Officia excepteur occaecat ullamco elit. Sit laborum et deserunt aliquip incididunt officia. Deserunt do eu non sint quis ullamco non laborum sunt tempor. Ex cupidatat proident anim eu ex qui qui reprehenderit. Consectetur deserunt aliqua dolor anim veniam anim irure do pariatur officia. Incididunt et qui irure esse proident est nisi aliquip.

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)