User:Dcoetzee/Wikicode/Pages needing conversion
From Wikipedia, the free encyclopedia
This pseudocode is no longer a proposed standard. See User:Dcoetzee/Wikicode.
Since wikicode was only put into effect after hundreds of thousands of articles had been written, ad hoc pseudocode is already present in many articles. In order to standardize, much of this pseudocode needs to be converted. This page will serve as a checklist of pages that haven't yet been converted, as well as a list of articles that might benefit from having it added. Add any pages you find which have pseudocode other than wikicode, even if they also have wikicode. Remove any fully-converted pages.
We may choose not to convert some of these pages; such pages will be noted below in the section Pages not needing conversion. If you think that any of the listed pages should not in fact use Wikicode, please move it to that section with an explanation; if there is any disagreement it should be raised on the talk page.
[edit] Pages needing conversion
- Bubble sort - there's implementations in a host of languages; they should be moved to wikisource and replaced with a single wikicode version.
- Added Wikicode but not moved to wikisource, if wikicode is ok, do it. 213.228.49.189 22:46, 14 May 2005 (UTC)
- CYK algorithm
- Dynamic programming (can copy some stuff from Dynamic programming/Implementations and Examples)
LURCH- only has wikicode- Probabilistic algorithm - mostly English this one
- Queue - an implementation in Scheme exists and will need to be moved to wikisource
- SHA family
- MD5
[edit] Pages not needing conversion
- Algorithm - because this is intended to be introductory material, it may be left as-is.
- Dijkstra's algorithm - this already has a very nice-looking pseudocode; I made it look a bit more like wikicode but won't convert all the way
[edit] Pages needing pseudocode added
Some pages are also good candidates for adding pseudocode to which do not already have it. Adding wikicode to these pages adds value and encourages standardization.
- Bluestein's FFT algorithm
Bresenham's line algorithm- done this one- Cooley-Tukey FFT algorithm
- Depth-first_search
- Dynamic programming/Implementations and Examples — incomplete matrix multiplication section will need it
Heapsort- begging for pseudocode- Merge algorithm
- Multiplication algorithm
- Prim's algorithm — maybe, if the English description isn't good enough
- Red-black tree
- Shifting nth-root algorithm
- Splay tree
- Tree search algorithm — and link depth-first, breadth-first, A*, and so on to here
- Xiaolin Wu's line algorithm - any code at all would be appreciated
