By what factor time complexity is reduced when we apply square root decomposition to a code?
(a) n
(b) √n
(c) n^2
(d) n^-1/2
This question was addressed to me during an online exam.
Origin of the question is Miscellaneous topic in chapter Miscellaneous of Data Structures & Algorithms II