0 votes 0 votes Solution of $T(n)=\sqrt{n}T(\sqrt{n})+n$ Algorithms recurrence-relation reference-book + – amit166 asked Sep 6, 2018 • retagged Jul 16, 2022 by Anjana5051 amit166 354 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes T(n) = O(nloglogn) Magma answered Sep 6, 2018 Magma comment Share Follow See all 4 Comments See all 4 4 Comments reply Magma commented Sep 6, 2018 reply Follow Share pic quality is poor ! sorry for that 0 votes 0 votes amit166 commented Sep 6, 2018 reply Follow Share GOOD NICE 0 votes 0 votes Raghav Khajuria commented Sep 6, 2018 i edited by Raghav Khajuria Sep 6, 2018 reply Follow Share I got nice explanation 0 votes 0 votes Raghav Khajuria commented Sep 6, 2018 reply Follow Share How u brought step after division ? Pls explain 0 votes 0 votes Please log in or register to add a comment.
