why is the time complexity of the improved solution n^n?
Hi @Olha_Bahatiuk
For the time complexity of the optimized solution of the N-Queens problem, we can say this:
Deriving a precise upper bound for this recurrence relation is beyond the scope of this course.
However, we can prove by induction that the time complexity, given this recurrence relation, is no worse than n^n.
Thanks for asking this question.
Happy learning 