A team sport game has m players in a team and a tournament can have n competing teams. Team ?1 can stand in front of team ?2 if there is a way such that every member of ?1 in a row is shorter than a corresponding member of ?2. (1) Give an example of four 3 member teams such that three teams can properly stand in three rows, and the fourth team does not fit (you can use a tuple of heights to represent a team); (2) Design an efficient algorithm (pseudo code) to determine whether or not two teams ?1 and ?2 can stand in front of one another; (3) Given ?? teams {?1,?2,…,??}, abstract the team standing problem as a graph; (4) Design an efficient algorithm (pseudo code) to find the longest sequence of teams such that ??? stands in front of ???+1 for ?=1,2,…,?−1; and analyze the time complexity of your algorithm in terms of ? and ?
Question- Single Source Shortest Path
A team sport game has m players in a team and a tournament can have n competing teams. Team ?1 can stand in front of team ?2 if there is a way such that every member of ?1 in a row is shorter than a corresponding member of ?2.
(1) Give an example of four 3 member teams such that three teams can properly stand in three rows, and the fourth team does not fit (you can use a tuple of heights to represent a team);
(2) Design an efficient
(3) Given ?? teams {?1,?2,…,??}, abstract the team standing problem as a graph;
(4) Design an efficient algorithm (pseudo code) to find the longest sequence <??1,??2,…,???> of teams such that ??? stands in front of ???+1 for ?=1,2,…,?−1; and analyze the time complexity of your algorithm in terms of ? and ?
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
