This week we dove head first into covering new algorithms. It was quite interesting (and fun) to learn about how different algorithms approach and work towards solving their intended use cases. What I mean by that, is each algorithm has cases it's typically designed to work well for and it's interesting to see those differences. For example, the quick sort algorithm is geared toward working on lists/arrays efficiently iterating over partitions. Where as binary search is about locating an element in a sorted list efficiently by halving the list repeatedly. It's just similar techniques/approaches but applied towards different goals/outcomes.
0 comments:
Post a Comment