Using Algorithms to Solve Hard Problems
Presented by: Manifest Solutions (Sponsor)Time: Thursday, Jan. 13, 2:15 PM - 3:00 PM
(Presented by Matt Norby)
When faced with a difficult coding problem and a deadline, it's tempting to copy someone else's code without really understanding it, or to lean on what we already know. Often, there are better solutions. By studying algorithms, we gain new problem-solving and evaluation tools, which can be very useful when selecting approaches that perform well with large data sets.
In this session, we will look at several sample problems, taken from a daily programming challenge website. There are multiple ways to approach each problem, but some are better than others. We will describe data structures like priority queue and trie, and algorithms like union find, that help to solve those problems efficiently. We will also explain how to compare and evaluate the solution approaches.