Slough
Slough (pronounced like "how", not like "snow") is a large town just west of London's Heathrow Airport, outside the M25, in Berkshire.
Understand
Get in
By plane
- Heathrow Airport (LHR IATA): buses 60, 61, 71, 75, 76, 77, 78 and National Express coach or by train changing at Hayes and Harlington or London Paddington
- Luton Airport (LTN IATA): National Express bus to High Wycombe and then X74, or train, changing in London
- London City Airport (LCY IATA): take London Underground services to London Paddington and continue by train
- Stansted Airport (STN IATA): National Express bus to High Wycombe and then X74, or train, changing in London
- Gatwick Airport (LGW IATA): train, changing in London or Reading
- Birmingham Airport (BHX IATA): train, changing in London
- Bristol Airport (BRS IATA): direct train from Bristol Temple Meads station - there is a shuttle bus to the airport
- Southampton Airport (SOU IATA) or Bournemouth Airport (BOH IATA): train, changing in Reading
- East Midlands Airport (EMA IATA): train, changing in London
By train
- 🌍 Slough station has a direct service from London Paddington, Reading, Oxford, Worcester, Bristol and Hereford.
By bus or coach
- Buses to nearby Reading go to Cheltenham and Gloucester.
- X74 bus serves High Wycombe
- National Express coaches go to London
Get around
See
- 🌍
Slough Museum, 278/286 High St, SL1 1NB, ☎ +44 1753 526422. W-Sa 11:30AM-4PM. Slough history and the town’s cultural heritage. Admission is free.
Do
Buy
Eat
Drink
Sleep
- 🌍 Holiday Inn Slough Windsor, Church St, Chalvey, SL1 2NH, ☎ +44 1753 551551. Brilliant for airport stopovers, conferences near London or visiting Legoland and Windsor Castle.
Connect
Go next
| Routes through Slough |
| Reading ← Maidenhead ← | W  |
→ Heathrow Airport → London |
| Reading ← Maidenhead ← | W  |
→ Heathrow Airport → London |
gollark: Still O(n), unfortunately, but doesn't require a universe destroying thingy, which can be expensive to obtain.
gollark: Okay, better sorting algorithm: scan through the list. Remove any element which is not in order.
gollark: I suppose I'll settle for O(log n).
gollark: We need an O(1)-time sorting algorithm.
gollark: But you need to check if it's sorted.
This article is issued from Wikivoyage. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.