Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional]

Loading...
From the course by Stanford University
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
955 ratings
Stanford University

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

955 ratings
Course 1 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science