Search for tag: "partition"
David Shmoys CAM Colloquium TalkZoom Recording ID: 95217932087 UUID: 7DGUy26ERIuva2i3Ltx8Nw== Meeting Time: 2021-03-05T20:18:20Z
From Erika Fowler-Decatur
12 plays
|
|
Lesson 30.8 Quicksort PerformanceIt looks like quicksort has solved our performance problems. However, we should not be so hasty. In this video, we look at the real performance for quicksort, and why it is not perfect. We also talk…
From Hannah Lee
36 plays
|
|
Lesson 30.7 QuicksortThe partition algorithm breaks up the list into two kind-of-sorted portions. In this video, we show how to use this fact with divide-and-conquer to implement a new sorting algorithm: quicksort. For…
From Hannah Lee
40 plays
|
|
Lesson 30.6 The Partition algorithmIn the previous video, we saw that nested loops are causing our sorting algorithms to be slow. To speed things up, we need to get rid of one of these loops. To do that, we will need a special…
From Hannah Lee
38 plays
|
|
Lesson 16.5 Positional For-LoopsSometimes we need to perform a calculation on a string, list, or tuple, but we do not want to loop over this value. Instead, we want to loop over the positions of the value. In this video we show why…
From Hannah Lee
90 plays
|
|