can anyone suggest me how to be good at recursion and what should be my approach? From where shall i solve questions?
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 24.04.2024 19:53:28 (h2).
Десктопная версия, переключиться на мобильную.
При поддержке
Standard recursion problem are in most cases easy. Recursion becomes harder when you’re solving dp with recursion so try some recursion dp problems.
Solving problems involving dfs is also a good thing to practice recursion.
Try to solve standard problems on dp. If not able to solve, understand it properly and solve some similar problems. Solve 50+ problems(if totally uncomfortable) and you will be good to go.
Check this
Still checking....
Too old joke
Good one mate !!
If you see this reply, don't click on the comment above. (Base case)
You can practice those problems for improving your skill on recursion. I hope it will be helpful for you.
Problems Link: https://codeforces.com/group/MWSDmqGsZm/contest/223339
solve recursion problems, duh
Solve problems tagged DP, Divide and Conquer, DFS and similar, for example 1461D - Divide and Summarize.
Surprisingly only 5 problems are tagged Divide and Conquer but are below 1600 rating.
Recursion? Check this out.
First, you must be good at recursion
ivan100sic can u plz suggest me some good places to start with recursion?
Okay, let's be a bit more serious now.
To be good at recursion, you must first identify simple cases which you will not solve recursively. Depending on the problem, this may be small values of $$$n$$$ e.g. $$$0,1$$$, or leaf nodes of a tree. Then, you must figure out how solving one instance of a problem relates to smaller problems. For example, when finding the maximum depth of a tree, the solution is the maximum of the maximum depths of all direct subtrees, plus one. Finally, when writing the recursive function, put the "simple case check" at the top and return the solution immediately if true, otherwise, make recursive calls, gather all the results, and form the return value based on those.
TLDR, learn from multiple resources. read and watch a lot of examples being solved. and do a lot of examples by yourself, gradually increase level, understand well how recursive code behaves. think of recursion as a method of solving problems by decomposing them into smaller versions. try to write a formal definition of your recursive solutions.
I think a good approach is the following:
Watch and read about recursion in many different resources. This helps me.
Watch or read about as many well-explained examples as you can. You should also try to actively engage and solve at this stage while watching
Now, do as many examples as you can by yourself . If you had some source of feedback, then excellent. if not, it's not a big problem since you should have some ability to self-correct now
Learn, when ready, advanced techniques like DP.
Please note the following:
Always try to well-define relationship between the problem and its subproblems and make it as clear as possible. IDEALLY, express it formally. This will payoff later when you start solving DP problems. example: count the min number of moves needed to solve 3-sticks Hanoi tower with n plates, a good formal expression of the recursive solution is:
Let f(n) denote the answer of n-plates tower. then f(0) = 0
f(n) = f(n-1) + 1 + f(n-1) = 2 * f(n-1) + 1. Now writing code is a piece of cake and also writing iterative solution is very easy. Please note that, the more complex the recursion, the more important is the formal definition.
Solve backtracking problems, especially those with lengthy implementation.