0 votes 0 votes While(n>=1) { n=n/20; n=n/6; n=10×n; n=n-10000; } Find time complexity. Algorithms time-complexity + – Meenakshi Sharma asked Sep 4, 2016 • retagged Jun 20, 2022 by makhdoom ghaya Meenakshi Sharma 683 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes T.c.=O(Log12(n)). // T(n) =T( (n*10)/120 - 1000) vijaycs answered Sep 4, 2016 • selected Sep 4, 2016 by Meenakshi Sharma vijaycs comment Share Follow See all 0 reply Please log in or register to add a comment.
