16Recursion depth n means the call stack uses:ANo spaceBO(n) spaceCO(1) spaceDO(log n) spaceView AnswerDiscussWorkspaceReportSaveEasy
17Which is true for large n?An log n < nBlog n < √n < n < n log nC√n < log nDn < log n < √nView AnswerDiscussWorkspaceReportSaveEasy
18What is the time complexity of this loop?i = 1 while i < n: i *= 2AO(log n)BO(n²)CO(n)DO(1)View AnswerDiscussWorkspaceReportSaveEasy
19The recurrence T(n) = T(n − 1) + n solves to:AO(n)BO(n²)CO(n log n)DO(2ⁿ)View AnswerDiscussWorkspaceReportSaveEasy
20The space complexity of an algorithm measures:AThe number of variables declaredBThe size of the source codeCDisk usageDThe extra memory it needs as a function of input sizeView AnswerDiscussWorkspaceReportSaveEasy