Most viewed questions in Programming and DS

2 votes
1 answer
122
The time required to search an element in a linked list of length n is$O(\log_2 n)$$O(n)$$O(1)$$O(n^2)$
48 votes
4 answers
125
2 votes
3 answers
129
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):4572360450
42 votes
5 answers
133
2 votes
3 answers
136
The minimum number of temporary variables needed to swap the contents of two variables is:(a) 1     (b) 2(c) 3     (d) 0
33 votes
10 answers
137