Yeah, top-down programming is useful for understanding recursion, e.g. "wishful thinking". I think Jerry Sussman describes this beautifully in this SICP lecture snippet
https://youtu.be/amf5lTZ0UTc?t=3501
"...but since I know [the function X], by wishful thinking, will produce the simplified result, then I don't have to think about it anymore. I've used it. I've used it in a reasonable way. I will get a reasonable answer."
I didn't understand recursion too well until finishing chapter 2 of SICP.
So recursion is just realizing that I can do the complex bit by calling the current function!
Of course, this sometimes means that the function signature needs to change, to (say) include a collecting list or something. But that's the general idea.
I'm not sure if this has ever helped anyone :-)