If a building has 'n' floors and 'm ' selections are currently active in the building 's elevator , what is the probability that the elevator is currently at the -LRB- numerically least highlighted number-1 -RRB- th floor ?
There are n numbers in any random order . How do I get top m numbers -LRB- m < = n -RRB- in descending order with least time complexity and most optimized ? -LRB- Java code -RRB-