2016 Knoxville Challenger
The 2016 Knoxville Challenger was a professional tennis tournament played on indoor hard courts. It was the thirteenth edition of the tournament which was part of the 2016 ATP Challenger Tour. It took place in Knoxville, United States between 6 and 13 November 2016.
2016 Knoxville Challenger | |
---|---|
Date | 6 – 13 November |
Edition | 13th |
Surface | Hard |
Location | Knoxville, United States |
Champions | |
Singles | |
Doubles | |
Singles main draw entrants
Seeds
Country | Player | Rank1 | Seed |
---|---|---|---|
Daniel Evans | 61 | 1 | |
Frances Tiafoe | 102 | 2 | |
Jared Donaldson | 109 | 3 | |
Bjorn Fratangelo | 110 | 4 | |
Denis Kudla | 130 | 5 | |
Tim Smyczek | 133 | 6 | |
Henri Laaksonen | 134 | 7 | |
Stefan Kozlov | 144 | 8 |
- 1 Rankings are as of October 31, 2016.
Other entrants
The following players received wildcards into the singles main draw:
The following player entered as an alternate:
The following players received entry from the qualifying draw:
Yuki Bhambri Liam Broady Daniel Cox Jared Hiltzik
The following player received entry as a lucky loser:
Champions
Singles
Michael Mmoh def. Peter Polansky, 7–5, 2–6, 6–1.
Doubles
Peter Polansky / Adil Shamasdin def. Ruben Bemelmans / Joris De Loore, 6–1, 6–3.
gollark: osmarkslisp™ just has `let` and `lambda`.
gollark: Real programmers use osmarkslisp™.
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?
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.