Timeline for answer to Time complexity of a backtracking algorithm by Ainsley H.
Current License: CC BY-SA 4.0
Post Revisions
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| 10 hours ago | comment | added | Platus | Thank you for your answer but sorry I'm not sure I understand fully. Could you please detail the proof? And also, how do we prove that this statement is true? "Each recursive call corresponds to a distinct prefix of some source-to-target path". To be honeste I'm no sure I fully understand the statement, sorry I lack some knowledge about DSA. | |
| yesterday | history | answered | Ainsley H. | CC BY-SA 4.0 |