Register

Algo Numerical

519 views
1 1 vote
Assume there are 1024 men, each of distinct arm strength, In an arm wrestling match stronger arm always wins. Number of arm wrestling match required to find men with strongest and second strongest arm in worst case is _________

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · MadeEasy Subject Tes...Next → · digital logic dual n...
← Previous in category · MadeEasy Subject Tes...Next in category → · Time complexity
Position:
Show:

Related questions

60 60 votes
4 answers 4 answers
24.9k
24.9k views
Arjun asked Feb 12, 2020
24,949 views
GATE CSE 2020 | Question: 23
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Ass...
4 4 votes
2 2 answers
453
453 views
GO Classes asked Sep 30, 2025
453 views
GO Classes DPP | Algorithm|DIJKSTRA’S ALGO
Suppose we run Dijkstra's single-source shortest path algorithm on the following edge-weighted directed graph with vertex $\mathbf{S}$ as the source. (Assume alphabetical...
4 4 votes
3 3 answers
503
503 views
GO Classes asked Sep 23, 2025
503 views
GO Classes DPP | Algorithm|DIJKSTRA’S ALGO
Consider the directed, weighted graph G defined by the following vertices and edges:Vertices: $\{A, B, C, D, E, F\}$Edges and Weights:$\mathrm{A} \rightarrow \mathrm{B}(4...
2 2 votes
2 2 answers
419
419 views
GO Classes asked Sep 18, 2025
419 views
GO Classes DPP | Algorithm |FLOYD WARSHALL’S ALGO
The Floyd-Warshall algorithm is used on a directed graph with 4 vertices (labelled 1, 2, 3, 4). The initial shortest distances are given by an adjacency matrix where "inf...