This week we spent time covering tree traversals, the quicksort algorithm and topological ordering. When I first read up on Khan's algorithm, I expected it to be harder to understand, but I was glad to realize it was quick to pick up. The challenge for me came when writing the code to implement topological ordering. I had no problem with the basic implementation, but I had trouble when the input data contained two source nodes. I was eventually able to figure out my mistake and got the code working. Another challenge for me was the last question of the quiz that involved the King's puzzle. I realized that my ability to recognize a pattern and turn it into a mathematical formula was a little rusty. This is definitely something I should brush up on before the final exam.
No comments:
Post a Comment