By what factor time complexity is reduced when we apply square root decomposition to a code?
By what factor time complexity is reduced when we apply square root decomposition to a code? Correct Answer √n
In square root decomposition a given array is decomposed into small parts each of size √n. This reduces the time complexity of the code by a factor of √n.
মোঃ আরিফুল ইসলাম
Feb 20, 2025