F2021 CS 340 Lecture 10 (Lower Bounds on Comparison-Based Sorting, Amortized Analysis) скачать в хорошем качестве

F2021 CS 340 Lecture 10 (Lower Bounds on Comparison-Based Sorting, Amortized Analysis)

Today we talked about comparison-based sorting algorithms and a lower bound, some remarks, then we began some discussion on amortized analysis. Remember, this lower bound result does prove algorithms like merge sort and any other Big Theta of n log n time algorithm (in the worst case, but also technically in randomized and average cases [no proof provided]) are optimal. Note: Toward the end I make a remark about needing to round the log_2{n!}. It should not be required. Please ignore that remark. Time Stamps: 0:00 Opening, Comparison-Based Model (Overall, Example, Connection) 19:54 Proof that any comparison-based sorting required Big Omega of n log n comparisons. 35:52 Lower Bounds are an Invitation 45:33 Beginning discussion on amortized analysis