Algorithm r o u n d R o b i n To u r n a m e n t $($ a $)$

This algorithm generates the list of matches that must be

played in a round $-$ robin pirate $-$ dueling tournament $($ a tournament where

each pirate duels each other pirate exactly once $).$

a is an array of strings containing names of pirates in the tournament

n $=$ a $.$ length

for i $=0$ to n $-1$

for j $=$ i $+1$ to n $-1$

print a $[$ i $]+"$ duels $"+$ a $[$ j $]+",$ Yarrr $!"$