Lecture 5: Linear Sorting

Name: Lecture 5: Linear Sorting
Uploaded: 2021-09-13T16:19:45Z
Duration: 51 min 57 s
Description: This builds on the lecture on improving find times and discusses how to achieve a faster sort. Direct access array sorts, tuple sorts, counting sorts, and radix sorts are discussed. Instructor: Jason Ku

51:57

Up Next

Problem Session 3

Continue

This builds on the lecture on improving find times and discusses how to achieve a faster sort. Direct access array sorts, tuple sorts, counting sorts, and radix sorts are discussed.

Instructor: Jason Ku