CP-3.001 - Visualising Problems and Subproblems

In this video I talk about how I visualise problem solving in my head, that is by breaking it down to smaller and smaller subproblems. I am going to follow this approach when explaining problem solving approaches like brute force, recursive backtracking, dynamic programming, and greedy algorithm, because ... well, that's just the way that I think! The video might be too simple for you, or too abstract, but it might be of use for someone who is new to programming and problem solving (although I assume that you understand recursion). Video Sections: 0:00 - Problems and subproblems 4:08 - Find largest element example 7:50 - Character counting example 9:56 - Quicksort example 12:32 - Maze example 16:10 - Summary