Concept

Quicksort

Related lectures (27)

Quick Sort: In-place Subdivision

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

Quick Sort Analysis: Finding k Smallest

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

Quick Sort: Divide-and-Conquer

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

Hashing and Sorting

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

Hashing and Quick Sort

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

Hashing & Sorting

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

Analysis of Randomized Quick Sort

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

Algorithms in Computer Science: Search and Sort Techniques

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

Sorting Algorithms: Selection and Insertion

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

Heapsort and Priority Queues

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

Merge Sort: Sorting Algorithm

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

Sorting Algorithms: Sorting Methods and Comparison

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

Hashing and Sorting Techniques in Database Systems

Provides an overview of hashing and sorting techniques in database management systems, focusing on their implementation and performance optimization.

Quicksort: Expected Running Time and Decision Tree

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

Median Search Algorithm

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

ServiceNow: Creating Dashboards and Reports

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

Heaps and Priority Queues

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

Language Theory into Practice

Explores the practical application of language theory, including quicksort, gradual typing, and efficient memory management, as well as the challenges of reduction program synthesis.

Heaps: Data Structure and Heapsort

Explores heaps, heapsort, and their efficiency in implementing priority queues.

Excel Upgrade: Advanced Functions and Data Analysis

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