2003 Samsung Open – Singles
Jonas Björkman was the defending champion but lost in the semifinals to Mardy Fish.
Singles | |
---|---|
2003 Samsung Open | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 6–3, 6–2 |
Draw | 32 |
Greg Rusedski won in the final 6–3, 6–2 against Fish.
Seeds
Younes El Aynaoui (Second Round) Mikhail Youzhny (First Round) Jarkko Nieminen (First Round) Vince Spadea (First Round) Jan-Michael Gambill (First Round) Max Mirnyi (Second Round) Taylor Dent (Quarterfinals, withdrew because of a back injury) Mardy Fish (Final)
Draw
Key
- Q = Qualifier
- WC = Wild Card
- LL = Lucky Loser
- Alt = Alternate
- SE = Special Exempt
- PR = Protected Ranking
- ITF = ITF entry
- JE = Junior Exempt
- w/o = Walkover
- r = Retired
- d = Defaulted
Finals
Semifinals | Final | ||||||||||||
Q | ![]() | 5 | 5 | ||||||||||
![]() | 7 | 7 | |||||||||||
![]() | 6 | 6 | |||||||||||
8 | ![]() | 3 | 2 | ||||||||||
8 | ![]() | 65 | 6 | 6 | |||||||||
![]() | 77 | 3 | 4 | ||||||||||
Top Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 77 | 6 | ||||||||||||||||||||||||
![]() | 62 | 4 | 1 | ![]() | 4 | 66 | |||||||||||||||||||||
Q | ![]() | 617 | 5 | ![]() | 6 | 78 | |||||||||||||||||||||
![]() | 719 | 7 | ![]() | 4 | 3 | ||||||||||||||||||||||
Q | ![]() | 6 | 3 | 6 | Q | ![]() | 6 | 6 | |||||||||||||||||||
![]() | 4 | 6 | 3 | Q | ![]() | 77 | 6 | ||||||||||||||||||||
![]() | 3 | 4 | 6 | ![]() | 64 | 2 | |||||||||||||||||||||
6 | ![]() | 6 | 6 | Q | ![]() | 5 | 5 | ||||||||||||||||||||
3 | ![]() | 4 | 4 | ![]() | 7 | 7 | |||||||||||||||||||||
![]() | 6 | 6 | ![]() | 6 | 6 | ||||||||||||||||||||||
![]() | 6 | 4 | ![]() | 4 | 1 | ||||||||||||||||||||||
![]() | 0 | 1r | ![]() | 4 | 77 | 77 | |||||||||||||||||||||
![]() | 1 | 5 | ![]() | 6 | 64 | 64 | |||||||||||||||||||||
![]() | 6 | 7 | ![]() | 6 | 6 | ||||||||||||||||||||||
WC | ![]() | 6 | 5 | 6 | WC | ![]() | 4 | 2 | |||||||||||||||||||
5 | ![]() | 4 | 7 | 4 |
Bottom Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
8 | ![]() | 6 | 3 | 6 | |||||||||||||||||||||||
![]() | 4 | 6 | 1 | 8 | ![]() | 6 | 6 | ||||||||||||||||||||
![]() | 4 | 3 | ![]() | 3 | 4 | ||||||||||||||||||||||
![]() | 6 | 6 | 8 | ![]() | 4 | 77 | 6 | ||||||||||||||||||||
![]() | 64 | 77 | 77 | ![]() | 6 | 64 | 4 | ||||||||||||||||||||
WC | ![]() | 77 | 62 | 64 | ![]() | 64 | 6 | 3 | |||||||||||||||||||
![]() | 7 | 6 | ![]() | 77 | 3 | 6 | |||||||||||||||||||||
4 | ![]() | 5 | 4 | 8 | ![]() | 65 | 6 | 6 | |||||||||||||||||||
7 | ![]() | 6 | 6 | ![]() | 77 | 3 | 4 | ||||||||||||||||||||
![]() | 3 | 4 | 7 | ![]() | 77 | 6 | |||||||||||||||||||||
Q | ![]() | 2 | 4 | ![]() | 62 | 4 | |||||||||||||||||||||
Q | ![]() | 6 | 6 | 7 | ![]() | ||||||||||||||||||||||
WC | ![]() | 6 | 77 | ![]() | w/o | ||||||||||||||||||||||
![]() | 4 | 64 | WC | ![]() | 65 | 2 | |||||||||||||||||||||
![]() | 6 | 6 | ![]() | 77 | 6 | ||||||||||||||||||||||
2 | ![]() | 2 | 0 |
gollark: Good idea.
gollark: But all the other cool languages have it and we MUST emulate them.
gollark: Oh, further gollarC idea: async/await! I don't know how this will be integrated into anything else and I don't care!
gollark: ÆÆÆÆÆÆÆÆÆÆææææææÆÆÆÆÆæææææÆÆÆÆææææææææÆÆÆÆÆæÆæ
gollark: Well, yes, but I see a decent amount of things implementing their own simple linked lists when in a sane language they would just use a `seq[T]` or `Vec<T>` and be faster and saner.
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.