|
Zoom Recording ID: 98994982951
UUID: b33PoJ7tRwK2JsiTXCv6wg==
Meeting Time: 2021-10-20T12:00:59Z
|
|
Zoom Recording ID: 92469038493
UUID: VBQgCUGuRQqY4gSfBRMUKQ==
Meeting Time: 2021-10-06T12:06:03Z
|
|
Zoom Recording ID: 94024818876
UUID: WkEc57p8Rki1XackPq0C9A==
Meeting Time: 2021-10-05T13:12:35Z
|
|
It 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…
Content Categories
Instructional Recordings Creation Date
December 11, 2020 Creator 1 First Name
Walker Creator 1 Last Name
White Creator 1 Role
Faculty or Staff Member Creator 1 NetID
wmw2 Language
English Searchable
Yes Searchable On
Cornell Web Search
|
|
The 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…
Content Categories
Instructional Recordings Creation Date
December 11, 2020 Creator 1 First Name
Walker Creator 1 Last Name
White Creator 1 Role
Faculty or Staff Member Creator 1 NetID
wmw2 Language
English Searchable
Yes Searchable On
Cornell Web Search
|
|
In 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…
Content Categories
Instructional Recordings Creation Date
December 11, 2020 Creator 1 First Name
Walker Creator 1 Last Name
White Creator 1 Role
Faculty or Staff Member Creator 1 NetID
wmw2 Language
English Searchable
Yes Searchable On
Cornell Web Search
|
|
|
|
|
|
National Science Foundation Computational Sustainability Video Game Projects - 2010-12-11
|