This week’s PowerPoint can be found here.
Topics covered:
- Big O Notation
- Big-O cheat sheet
- Recommended reading – interviewcake overview of Big O
- Cracking the Coding Interview author giving a pretty awesome, to-the-point explanation of Big O
- [Extra] If you’re curious about the different notations (O, o, Ω, ω, Θ) and what they actually mean, this stackoverflow discussion has a lot of great, short explanations
- Heap Sort
- Dijkstra’s algorithm
- Geeksforgeeks overview with sample Dijkstra code in C++, Java, and python
- Online visualization where you can pick your starting node and see Dijkstra’s go to work
- An even better visualization of single-source shortest paths, with multiple choices of algorithm (including Dijkstra’s)
- Computerphile video with Dijkstra example
Problems solved:
SIG business:
- Actively searching for a new room to meet in, so stay tuned
- Actively searching for a new meeting time that will still accommodate as many members as possible, so stay tuned and fill out our survey so that your voice is heard
- Future topic suggestions: DTMF, Google Maps, comparison between small scale implementations that we can all do and large scale implementations done by companies
