0 votes 0 votes in a sorted array of n distinct element finding i th largest element take o(1) . true / false Programming in C data-structures programming-in-c easy + – Gurdeep Saini asked Jan 18, 2019 • retagged Jan 18, 2019 by Gurdeep Saini Gurdeep Saini 519 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply raahul commented Jan 18, 2019 reply Follow Share True. 0 votes 0 votes Gurdeep Saini commented Jan 18, 2019 reply Follow Share yes, can u explain ? 0 votes 0 votes Gurdeep Saini commented Jan 18, 2019 reply Follow Share if i is as large as n then ? 0 votes 0 votes srestha commented Jan 18, 2019 reply Follow Share then we can just do it , by putting it's index number directly 2 votes 2 votes Please log in or register to add a comment.
0 votes 0 votes It is true as the ith element is equal to array[i] which takes O(1) Mohitkumaraiactr answered Jan 18, 2019 Mohitkumaraiactr comment Share Follow See all 0 reply Please log in or register to add a comment.