CS Online Weekly Updates

this week we learned a ton of new algorithms. we learned counting sort, which I think is pretty cool, and a lot of dynamic programming. Dynamic programming is solving small subproblems to help the algorithm be more efficient. We also learned about Floyd/warshall shortest path, and the greedy approach. The greedy approach is pretty simple compared to the others. I enjoyed this week as I like solving little graphing problems and matrix problems.

This week we learned a lot about maxheaps, and linear probing in hash tables. We also learned about AVL trees which are similar to binary trees. With the max heap and hash tables we learned how to insert, delete, and rebalance/rehash the trees to make sure they are balanced and are large enough based on load factors. All of which help prioritize time efficiency of a program which is what we are striving for.