Date: Thursday 27th March 2014
Venue: Staffordshire University – Stafford Campus (Octagon building, K102)
We like change, so consider throwing some into this exercise (particularly those who have done it before). Some suggestions:
- Profile the application, perhaps in both time (execution speed) and space (memory usage).
- Consider intermediate list processing and storage (structure the word list).
- Try TDD in a pair.
- Complete Dave’s suggestions - For added programming pleasure, find the longest words that are anagrams, and find the set of anagrams containing the most words (so “parsley players replays sparely” would not win, having only four words in the set).
The word list we used last time is still available on my blog. Bring your own laptops and whatever programming tools you wish. Wireless Internet access and a desktop computer with which to cut code will be available should you require it.
I look forward to seeing you this March!