Talk:Pi: Difference between revisions
Content added Content deleted
m (added comment about keyboards with no break key. -- ~~~~) |
(C# version is wrong!) |
||
Line 68: | Line 68: | ||
:::Hm. It might be worth scrapping the task and creating more defined ones, such as [[Pi/Bailey-Borwein-Plouffe]], and leave the "Pi/" namespace available to other specific implementations.--[[User:Short Circuit|Michael Mol]] 15:03, 26 July 2011 (UTC) |
:::Hm. It might be worth scrapping the task and creating more defined ones, such as [[Pi/Bailey-Borwein-Plouffe]], and leave the "Pi/" namespace available to other specific implementations.--[[User:Short Circuit|Michael Mol]] 15:03, 26 July 2011 (UTC) |
||
:::[[Pi]] can be implemented without use of a spigot algorithm regardless of efficiency, because that algorithm is not good at being efficient at all. The C program I wrote continuous generates Pi digits faster than the unbound spigot, despite the algorithm used was totally unsuitable for the task. --[[User:Ledrug|Ledrug]] 00:07, 27 July 2011 (UTC) |
:::[[Pi]] can be implemented without use of a spigot algorithm regardless of efficiency, because that algorithm is not good at being efficient at all. The C program I wrote continuous generates Pi digits faster than the unbound spigot, despite the algorithm used was totally unsuitable for the task. --[[User:Ledrug|Ledrug]] 00:07, 27 July 2011 (UTC) |
||
== C# - incorrect solution == |
|||
The C# version produces output where only first 30% is correct, then goes garbage. For example, here's what it outputs when asked for 50 digits: |
|||
3141592653589792800649014751202138549699509907712322 |
|||
while correct digits are |
|||
3141592653589793238462643383279502884197169399375105. |
|||
The D version which uses similar but slightly different algorithm is correct. |
|||
--[[User:thedeemon|thedeemon]] 24 October 2012 |
|||
== Pi vs tau == |
== Pi vs tau == |