1 votes 1 votes closed with the note: duplicate int unknown(int n) { inti, j, k = 0; for (i = n/2; i<= n; i++) for (j = 2; j <= n; j = j * 2) k = k + n/2; return k; } What is the returned value of the above function? (GATE CS 2013) (a) Ѳ(n2) (b) Ѳ(n2 log n) (c) Ѳ(n3) (d) Ѳ(n3 log n) Algorithms asymptotic-notation algorithms time-complexity functions + – NIKU asked Nov 14, 2017 • closed Nov 14, 2017 by Rupendra Choudhary NIKU 697 views comment Share Follow See all 2 Comments See all 2 2 Comments reply Anu007 commented Nov 14, 2017 reply Follow Share https://gateoverflow.in/1542/gate2013_31 0 votes 0 votes Mahbub Alam commented Nov 19, 2018 reply Follow Share Option (B) is the correct according to the question 0 votes 0 votes Please log in or register to add a comment.