3 votes 3 votes https://gateoverflow.in/?qa=blob&qa_blobid=6856287731579574233 someone plz tell ?? Algorithms made-easy-test-series algorithms time-complexity + – aaru14 asked Nov 23, 2017 • edited Mar 3, 2019 by adeebafatima1 aaru14 474 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Ashwin Kulkarni commented Nov 23, 2017 reply Follow Share yes then above explanation is your solution ! 0 votes 0 votes kirti_k commented Nov 23, 2017 reply Follow Share yes its constant time O(1). 0 votes 0 votes suvradip das commented Jan 13, 2020 reply Follow Share Whatever be the value of n the answer is O(1). 0 votes 0 votes Please log in or register to add a comment.