Quiz · 4 questions
🪆 Recursion & Divide and Conquer
Solving a problem with smaller copies of itself
Level 0Curious Beginner
0 XP0/85 lessons0/19 achievements
0/100 XP to next level100 XP to go0% complete
Quiz
01Every correct recursive function must have...
02Recursion uses memory because...
03Divide-and-conquer algorithms (like merge sort) get their complexity from...
04Backtracking solves problems by...
Hint
It's DFS with an 'undo' — make a choice, and if it fails, step back and try another.
Comments 0
🔔 Reply notifications (sign in)Sign in — Please sign in to comment.
No comments yet — be the first.