Register

ISI 2021

• reshown by
492 views
1 votes
1 votes
Give a strategy to sort four distinct integers a, b, c, d in increasing order that minimizes the number of pairwise comparisons needed to sort any permutation of a, b, c, d.
• reshown by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

436
views
1 answers
1 votes
rsansiya111 asked Feb 28, 2022
436 views
ISI 2021
Five men A, B, C, D, E are wearing caps of black or white color without each knowing the color of his cap. It is known that a man wearing a white cap will ... three black caps.D: I see four white caps. Find the color of each person's cap.
User Avatar
932
views
1 answers
1 votes
rsansiya111 asked Feb 28, 2022
932 views
ISI 2021
Let us consider the following 2-person game: the players alternately choose a number. The first player starts with a number between 1 and 10, and the players ... strategy of his opponent, the first player will be able to reach 100 first?
User Avatar
820
views
1 answers
0 votes
Tesla! asked Apr 24, 2018
820 views
ISI-2017-MMA-16
Let $(x_n)$ be a sequence of a real number such that the subsequence $(x_{2n})$ and $(x_{3n})$ converge to limit $K$ and $L$ respectively. Then$(x_n)$ always ... converge$(x_n)$ may not converge but $K=L$it is possible to have $K \neq L$
User Avatar
434
views
2 answers
1 votes
Ramayya asked Jan 7
434 views
ISRO 2024
Asymmetric encryption is not suitable for ConfidentialityAuthenticationKey ExchangePrevention of Denail of Service
User Avatar
Link Copied!