Golf at the 2013 Island Games
Golf, for the 2013 Island Games, took place at the Port Royal Golf Course in Southampton Parish, Bermuda.[1] The competition ran from 15 to 18 July 2013.[2]
Medal table
* Host nation (Bermuda)
| Rank | Nation | Gold | Silver | Bronze | Total |
|---|---|---|---|---|---|
| 1 |  | 1 | 1 | 0 | 2 |
 | 1 | 1 | 0 | 2 | |
| 3 |  | 1 | 0 | 1 | 2 |
 | 1 | 0 | 1 | 2 | |
| 5 |  | 0 | 2 | 0 | 2 |
| 6 |  | 0 | 0 | 1 | 1 |
 | 0 | 0 | 1 | 1 | |
| Totals (7 nations) | 4 | 4 | 4 | 12 | |
Medal summary
Men
| Event | Gold | Silver | Bronze | |||
|---|---|---|---|---|---|---|
| Individual[3] | | 297 | | 298 | | 301 |
| Team[4] | | 905 | | 906 | | 912 |
Women
| Event | Gold | Silver | Bronze | |||
|---|---|---|---|---|---|---|
| Individual[5] | | 313 | | 318 | | 320 |
| Team[6] | | 997 | | 1000 | | 1009 |
gollark: ```lisp (let (qsort xs cont) (cond ((= xs '()) (cont '())) (true (do (let h (head xs)) (let t (tail xs)) (let part_result (partition_rec t (lambda (x) (< x h)) '(() ()))) (qsort (head part_result) (lambda (ls) (qsort (snd part_result) (lambda (rs) (cont (+ ls (list h) rs)))))) )) ))```↑ provably optimal sorting algorithm
gollark: Well, in Haskell you would just use the highly efficient quicksort from somewhere.
gollark: Carbohydrates?
gollark: Oh no. I forgot how merge sort works. Oh apioid.
gollark: Oh, merge sort.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.