0 0 votes Algorithms time-complexity algorithm-design + – eyeamgj 610 views answer comment Share Follow Print See all 4 Comments 4 4 Comments reply Hemanth_13 commented Nov 19, 2018 reply Follow flag O(n)? 0 0 replyShare eyeamgj commented Nov 19, 2018 reply Follow flag THIS IS GIVEN 0 0 replyShare Naveen Kumar 3 commented Nov 19, 2018 reply Follow flag click 0 0 replyShare Hemanth_13 commented Nov 19, 2018 reply Follow flag What I thought was convert n bit binary numbers into integer this takes O(n). multiply them it takes O(1). Convert back it to binary O(n). So O(n). But these questions are meant to giving a look no to take too seriously 0 0 replyShare Please log in or register to add a comment.
