1 votes 1 votes how the tc is O(n^4) Algorithms made-easy-test-series algorithms time-complexity + – eyeamgj asked Jan 30, 2018 • retagged Jun 29, 2022 by makhdoom ghaya eyeamgj 286 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Time Complexity :-O(n^4) Rohit Pandey answered Jan 31, 2018 • selected Jan 31, 2018 by sumit goyal 1 Rohit Pandey comment Share Follow See all 0 reply Please log in or register to add a comment.