This week I got a better understanding of some core algorithm techniques. Quick Sort stood out as a strong example of divide and conquer breaking problems into smaller parts to solve them efficiently. I also learned how binary trees work especially how to traverse them and calculate their height. We explored decrease and conquer which is similar to divide and conquer but focuses on solving smaller pieces one at a time. Insertion sort and Khan’s algorithm for topological sorting helped with that. We also looked at transform and conquer like using pre sorting to simplify a problem.

Comments

Popular posts from this blog