0 votes 0 votes In worst case, for each "n" we have to check every "n then how O(n) ? Algorithms graph-algorithm + – HeadShot asked Dec 1, 2018 • retagged Jun 10, 2022 by Arjun HeadShot 598 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Magma commented Dec 1, 2018 reply Follow Share @OneZero How you got time complexity : O(n) explain 0 votes 0 votes OneZero commented Dec 1, 2018 reply Follow Share i didnt get time complexity as O(n). 0 votes 0 votes HeadShot commented Dec 2, 2018 reply Follow Share I dont know how its working, if someone got how O(n) then plz explain algo with TC. Given solution : 0 votes 0 votes Please log in or register to add a comment.
