From Wikipedia, the free encyclopedia

Welcome!

Hello DNA Games, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay.

In Wikipedia, new Users do not automatically receive a welcome; not even a machine-generated welcome. Welcome messages come from other Users. They are personal and genuine. They contain an offer of assistance if such assistance is ever desired.

I suggest to everyone I welcome that they may find some of the following helpful — there’s nothing personal in my suggestion and you may not need any of them:

I hope you enjoy editing here and being a Wikipedian! Please sign your name on Talk pages (ie discussion pages) using four tildes (~~~~); this will automatically produce your name and the date. If you need help, check out Wikipedia:Questions, ask me on my talk page, or place {{helpme}} on your talk page and ask your question there. Again, welcome!  Dolphin51 ( talk) 11:26, 9 May 2009 (UTC) reply


Proposed deletion of Dec2frac algorithm

The article Dec2frac algorithm has been proposed for deletion because of the following concern:

Wikipedia is not a how-to guide.

While all contributions to Wikipedia are appreciated, content or articles may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the {{ dated prod}} notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the article to address the issues raised. Removing {{ dated prod}} will stop the Proposed Deletion process, but other deletion processes exist. The Speedy Deletion process can result in deletion without discussion, and Articles for Deletion allows discussion to reach consensus for deletion. —Largo Plazo ( talk) 18:14, 11 August 2009 (UTC) reply

I have nominated Near Root Algorithm, an article that you created, for deletion. I do not think that this article satisfies Wikipedia's criteria for inclusion, and have explained why at Wikipedia:Articles for deletion/Near Root Algorithm. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time.

Please contact me if you're unsure why you received this message. Cybercobra ( talk) 13:45, 12 August 2009 (UTC) reply

Near Root Algorithm

Wikipedia is not a venue for self-publication of original research (regardless of its quality), at least until your algorithm gets covered in reliable sources; until then, it's not notable and thus not appropriate for inclusion in Wikipedia. You should put the algorithm on your own website, and then you can try linking to it in the External links section of an appropriate Wikipedia article. -- Cybercobra ( talk) 16:02, 12 August 2009 (UTC) reply

Nor are we a how-to guide.
You may wish to discuss your program with your C++ instructor: it doesn't fail safe. What happens if the argument is negative? What if the last digit of the floatingpoint representation fluctuates between 0 and 1? In either case, the loop end condition will never be met, and the program will run until the system gets tired of it. Septentrionalis PMAnderson 17:15, 14 August 2009 (UTC) reply