Since my editorial (http://www.sqlservercentral.com/articles/Editorial/69646/) turned into a performance question, I thought I'd ask what the best way to solve this question is:
Write code that will produce a list of sequential numbers (count unknown). For each multiple of:
- 3, replace 3 with Fizz
- 5, replace 5 with Buzz
- 3 and 5, replace with FizzBuzz
You can choose any method, and we are looking for the best code, in terms of scale and performance, with minimal resource loads.
If there are limitations to your code, please list them. Use comments to note issues with code.
The highest voted item on Mar 31 gets $25 to Amazon.