is it c?

The Gateway to Computer Science Excellence

0 votes

Consider the multi selection problem:

Given a set 'S' of n elements and set 'K' of 'r' ranks $K_{1}$, $K_{2}$, ....$K_{r}$. Find the $K_1^{th}$, $K_2^{th}$, ....$K_r^{th}$ smallest elements.

Example K = {3,7,10,50} the problem is to find the $3^{rd}$, $7^{th}$, $10^{th}$, $50^{th}$ smallest elements. The time complexity of the most efficient algorithm to solve this problem is

A. O(n.r)

B. O($n^2$.log r)

C. O(n)

D. O(n.log r)

Given a set 'S' of n elements and set 'K' of 'r' ranks $K_{1}$, $K_{2}$, ....$K_{r}$. Find the $K_1^{th}$, $K_2^{th}$, ....$K_r^{th}$ smallest elements.

Example K = {3,7,10,50} the problem is to find the $3^{rd}$, $7^{th}$, $10^{th}$, $50^{th}$ smallest elements. The time complexity of the most efficient algorithm to solve this problem is

A. O(n.r)

B. O($n^2$.log r)

C. O(n)

D. O(n.log r)

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,650 questions

56,238 answers

194,267 comments

95,874 users