1Which complexity class is the fastest-growing among these?AO(2ⁿ)BO(n log n)CO(n²)DO(n³)View AnswerDiscussWorkspaceReportSaveEasy
2What is the time complexity of this loop?i = 1 while i < n: i *= 2AO(log n)BO(n²)CO(n)DO(1)View AnswerDiscussWorkspaceReportSaveEasy
3What is the time complexity of the following code?for i in range(n): for j in range(n): total += 1AO(log n)BO(2n)CO(n)DO(n²)View AnswerDiscussWorkspaceReportSaveEasy
4An algorithm that uses a fixed amount of extra memory regardless of input size has space complexity:AO(n)BO(log n)CO(1)DO(n²)View AnswerDiscussWorkspaceReportSaveEasy
5The recurrence T(n) = 2T(n/2) + n solves to:AO(n)BO(n²)CO(log n)DO(n log n)View AnswerDiscussWorkspaceReportSaveEasy