Cryptography is a nastily mathematical subject based largely on number theory. If you're still reading this far - congrats
Unfortunately there is only one cipher that is mathematically proven to be unbreakable - the Vernam Cipher (ie the 'one time pad'). The other ciphers are breakable, but the key question is 'how long would it take to break?'. The examples given above (no offence intended guys) would be trivial. For example...
(1) IBOL's first example looks like an affine cipher...not hard to break.
(2) Atreides XOR - if the key is the same length as the plaintext then you have a vernam cipher. If the key is shorter, weeeelllll....look at www.phreedom.org/solar/honeynet/scan16/scan16.html for how to make it more difficult to cryptanalyse. However, XOR's aren't ideal by themselves (understatement).
(3) Ravens code - I'm a C++ programmer, new to DB. As I read it this prog just swaps the bits around. Out of all of the methods so far this would be the hardest to break. This isn't saying much however, as it is still weak and a bit of lateral thinking would break this.
A strong cipher is only as good as the program it's in. If I wanted to 'break' a cipher I'd simply crack the program instead as it is the easier option. Look at SoftIce, IDA Pro...
For more info read 'Hacker Disassembling Uncovered' by Kris Kaspersky - very good book about how to crack programs (working on the 'know your enemy' premise). There are various books on cryptography, but one of the easiest to read is 'Applied Cryptography' by Bruce Schneier. The rest are a very 'dry' textbooky read, even if you are interested in number/information theory.