Content deleted Content added
m Automated conversion |
No edit summary |
||
Line 8:
Most of the discussion above is pretty confused. Rabin's method isn't theoretically unbreakable, RSA and Diffie-Hellman are essentially never used to exchange one-time pad keys, RSA is not normally thought of as a key-exchange protocol, properly applied RSA may in fact be impossible to break, etc. But I don't have the time to write a section on cryptography just yet. --[[:Kragen|Kragen]]
----
I think it would be a great idea if we came to some sort of standard on writing pseudocode. I've used a sort of hybrid procedural style for the algorithms in [[:Linear search|Linear search]] and [[:Binary search|Binary search]] but I'm wondering if there's a better standard out there. Can we borrow a style from a textbook like Intro to Algorithms? (is this copyrighted or is style a public ___domain thing like an idea?). Only a fairly small set of control structures is needed -- something to define functions, if-statements, loops, list access, mathematical operators and probably a few more. Comments? [[user:Mark Jeays|Mark Jeays]]
:I do think we should try to do standard pseudocode. I have no idea what that pseudocode should be however. CLR's style is usually clear, but sometimes I find it confusing (often because I do not parse the <code>A <- B</code> assignment syntax properly). I don't think things like pseudocode style are copyrightable... We should make a [[:pseudocode|pseudocode]] article that defines whatever we use (in addition to explaning what pseudocode is in general), then link to that from every pseudocode example. In addition, we could include examples in other languages (see [[:bubble sort|bubble sort]] for example) by putting them in subpages like [[:bubble sort/C++|bubble sort/C++]]. --BlckKnght
| |||