Use DeepSeek R1 to rigorously analyze and prove the time and space complexity of an algorithm, including amortized analysis, recurrence solving via the Master Theorem, and tight lower bounds.
## CONTEXT Stating an algorithm's complexity is easy; proving it rigorously is where reasoning models add value and where they most often cut corners. DeepSeek R1 can recite that quicksort is O(n log n) on average, but a real complexity proof requires reasoning about the recurrence, applying the Master Theorem with…
Premium Prompt
Unlock this prompt — and all 25,000+ expert-crafted prompts — with Pro.
Unlock with Pro