Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Quicksort

Related lectures (27)

Explains the in-place subdivision method for quicksort with a unique pivot, covering its temporal complexity.

Covers the analysis of quick sort, including time complexity and randomization for finding the k-th smallest number.

Covers the efficient implementation of hash tables and the Quick Sort algorithm.

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

Explores sorting methods, insertion sort, and algorithm comparison for efficient data organization.

Discusses the expected running time of randomized quicksort and decision trees as an abstraction of comparison sorts.

Covers the median search algorithm and the Hoare algorithm for finding the smallest element in a list.

Explores creating dashboards in ServiceNow, focusing on advantages, transition from homepages, and important concepts like tasks and incidents.

Explores heaps, heapsort, and priority queues, including operations and analysis.

Covers advanced Excel functions and data analysis techniques, including automatic recording and using Solver.

Explores recursive sorting algorithms, recursion, dynamic programming, and the efficiency of recursive solutions.

Covers the resolution of linear systems using the Gauss method to determine unique, infinite, or no solutions.

Explores the Quick Sort algorithm, focusing on its divide-and-conquer approach and time complexity analysis.

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Explores hashing techniques like static, extendible, and linear hashing, along with sorting methods such as external merge sort and B+ trees.

Analyzes the running time and comparisons in randomized quick sort, proving its efficiency and optimality in comparison sorting.

Provides an overview of essential search and sort algorithms in computer science.

Covers the Heapsort algorithm, which sorts arrays efficiently using max-heaps and introduces priority queues.