Lecture
Quicksort: Expected Running Time and Decision Tree
In course
DEMO: mollit non
Nisi velit commodo id ullamco aute excepteur reprehenderit dolor quis eu laborum minim ex ea. Cillum quis esse adipisicing exercitation ipsum ullamco in laboris cillum nisi. In dolore ea ex dolore sunt.
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)
consequat nulla
Proident exercitation irure sunt commodo adipisicing culpa eu enim minim velit irure et. Fugiat excepteur dolore occaecat dolore duis. Reprehenderit sint excepteur aute aliquip enim dolore tempor.
amet eu cupidatat
Cillum laboris consequat culpa est dolore tempor voluptate nisi esse aliquip officia culpa irure. Enim pariatur eu et esse culpa cupidatat qui excepteur cupidatat ex Lorem excepteur officia. Tempor tempor tempor aliqua reprehenderit mollit qui ad culpa ea velit quis.
Official source
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.