Algorithm for determining who won rock paper scissors game, Data Structure & Algorithms

Suppose you are given the results of 5 games of rock-paper-scissors. The results are given to you on separate pieces of paper; each piece says either 'A' if the first person won, or 'B' if his opponent won.  

Write an algorithm, in English, for determining who won the best out of 5 games (person A or person B).

 

Posted Date: 3/20/2013 2:04:19 AM | Location : United States







Related Discussions:- Algorithm for determining who won rock paper scissors game, Assignment Help, Ask Question on Algorithm for determining who won rock paper scissors game, Get Answer, Expert's Help, Algorithm for determining who won rock paper scissors game Discussions

Write discussion on Algorithm for determining who won rock paper scissors game
Your posts are moderated
Related Questions
Description A heap is an efficient tree-based data structure that can be used as a priority queue. Recall that the abstract data type of a priority queue has the following opera

Q. Convert the given infix expression into the postfix expression (also Show the steps) A ∗ (B + D)/ E - F(G + H / k ) Ans. Steps showing Infix to Post fix

Write an algorithm to test whether a Binary Tree is a Binary Search Tree. The algorithm to test whether a Binary tree is as Binary Search tree is as follows: bstree(*tree) {

Q. Calculate that how many key comparisons and assignments an insertion sort makes in its worst case?        Ans: The worst case performance occurs in insertion

discuss the operating system under the following: MONOLITHIC SYSTEM,LAYER SYSTEM AND VIRTUAL MACHINES

What is Solid modeling Solid modeling is the most powerful of the 3-D modeling technique. It provides the user with complete information about the model. Defining an object wit

how do we use 4-discs stack to solve tower of hanoi problem and write an algorithm to solve it?


We have discussed already about three tree traversal methods in the earlier section on general tree. The similar three different ways to do the traversal -inorder , preorder, and p

State the ways to construct container taxonomy There are several ways that we could construct our container taxonomy from here; one way that works well is to make a fundamental