Week 9 Day 2 - Algorithms II

Channel:
United States Bill Kerney
Subscribers:
2,700
Published on ● Video Link: https://www.youtube.com/watch?v=0I8ZN2Cr1J4


Duration: 56:46
95 views
0

Today we talked about three algorithms:


1) Finding the minimum element in an array (pretty simple, just loop across it and keep track of what the smallest you've seen so far is)


2) Map coloring (coloring a map with different colors so that adjacent things don't have the same color), which is useful in a bunch of weirdly unrelated areas.


3) Sorting, specifically merge sort. Merge sort is an example of a divide and conquer algorithm.



Other Videos By Bill Kerney


2021-03-24Week 11 Day 2 - Big O, Heaps, Hash Tables
2021-03-24Week 11 Day 1 - How Color Works
2021-03-24Week 11 Day 1 - From Low Level Syscalls to High Level Modern C++
2021-03-23Week 10 Day 1 - Social Impact of Computer Science
2021-03-22Week 10 - Triangularization and Rasterization
2021-03-22Week 11 Day 1 - Move Constructors
2021-03-20Week 10 Day 3 - Sets vs. Maps vs. Unordered Maps
2021-03-19Week 9 Day 3 - Algorithmic Bias
2021-03-19Week 10 Day 2 - HUDs
2021-03-18Week 10 Day 2 - NEON Part III, CALL
2021-03-18Week 9 Day 2 - Algorithms II
2021-03-17Week 10 Day 2 - BSTs Part 3
2021-03-16Week 10 Day 1 - Fast Inverse Square Root and Duff's Device
2021-03-16Week 10 Day 1 - Guest Lecture + Animation
2021-03-16Week 9 Day 1 - Algorithms
2021-03-15Week 10 Day 1 - BSTs Part II
2021-03-13Extra Credit Workshop: Sea Shanties
2021-03-13Week 8 Day 3 - Quantifier Fallacies and Cognitive Biases
2021-03-12Week 9 Day 3 - Binary Search Trees
2021-03-12Week 9 Day 2 - Matrix Multiplies and Interactivity
2021-03-11Lecture 9 Day 2 - Floating Point Numbers


Tags:
CSCI 1
algorithms
map coloring
minimum element
merge sort