This week we learned a great deal of new concepts. The first was how to utilize the quick sort algorithm and how it is based on the divide and conquer technique. This technique aims to break a problem into smaller and smaller parts until the problem is easily solvable, and then the solution is applied to essential conquer a big problem by breaking it apart. We also learned more about binary tree traversal and the different methods for moving through binary trees. We also learned about the concept of tree height calculation which is a good indicator of the worst case scenario in tree traversal. One of the big take aways from this week was learning about Kahn's algorithm and how it is useful for topologically sorting data. A lot of great concepts this week that I will have to revisit before the final.
For the Markov code review I worked with my teammate Brandon Hoppens. My strategy for the Markov assignment was to first read through the entire prompt and ensure that I had a general idea of what the program was supposed to do. I then worked through the prompt building each method before moving on to the next. I built all of the methods and then ran the test after my initial build. I was able to pass a few of the test and failed others. I then went back to the individual tests I failed and manually debugged them. This was in contrast to how Brandon tackled the prompt as he was implementing the methods as they were needed. He worked to ensure each piece that he added worked with the existing code base. I think I would change my strategy to adopt some of his methods and use an incremental approach. I relied on building the entire program before running the first test, and I can see how on bigger projects this could lead to some frustration. The feedback I received from Brandon was ...
Comments
Post a Comment