hello you awesome people.I am studying divide and conquer technique nowadays.I am not getting in what scenario i have to use it.I have seen few algorithms like sorting(merge,quick),searching(binary) and few more..still i am not getting how to make my own divide and conquer algorithm for questions like finding largest element of array,maximum subset sum,multiplying polynomials,etc..

My few doubts 1) In what scenarios/problems Do i force myself to think Divide and conquer way ? 2) How to frame my own divide and conquer solution ?

I will be Obliged.Please Help.