Week 15 Day 3 - Radix Sort

Channel:
Subscribers:
2,700
Published on ● Video Link: https://www.youtube.com/watch?v=1sO34qhOens



Duration: 1:31:19
54 views
1


Today we started off reviewing the competency exams, and finished with a brief introduction to Java, which will be continued next week.


Most of what we talked about today was Radix Sort, which is a way of sorting numbers faster than the theoretical maximum - the theoretical maximum is for random data, but Radix sort works well when the numbers have a small range. I also show how to use the random library with bind() to make a function to make random numbers in a way better than using rand(). This code is similar to your histogram assignment, where you will count how many times each ASCII code appears in a text file.







Tags:
csci 41
radix sort
random
c++