[Pain]

@krypt3dkn1gh7, seriously you're watching me? Lol.

@RA1N yeah i do i need help with how to write Unit Tests it's killing me .

[ch3rn0byl]

@krypt3dkn1gh7, seriously you're watching me? Lol.

@RA1N yeah i do i need help with how to write Unit Tests it's killing me .

lol Oh yea! It puts the lotion on the skin err else it gets the hose again :oO:

[JesseH]

Hey,
Since you moved on from Python to Java, maybe once you get tired of Java, you could move on to Lua?

http://www.lua.org/ -- That is the main Lua site.

http://www.lua.org/manual/5.1/ -- Lua reference for 5.1

http://lua-users.org/wiki/TutorialDirectory -- The best place to start!

Lua is mainly used for embedding, however you can write full Lua programs, using library bindings such as LuaQt, and Lua's QMT bindings.
I primarily use Lua with the LÖVE engine to create 2d games. I am working on a commercial one with it atm! We will see how that works out.

Once my two hours is up, I plan on writing a Lua tut or two.
If you do decide to use it, then feel free to PM me. I can help you out.

Anyhow, happy language hunting, and happy learning!

JesseH

[LightX]

Hey,
Since you moved on from Python to Java, maybe once you get tired of Java, you could move on to Lua?

http://www.lua.org/ -- That is the main Lua site.

http://www.lua.org/manual/5.1/ -- Lua reference for 5.1

http://lua-users.org/wiki/TutorialDirectory -- The best place to start!

Lua is mainly used for embedding, however you can write full Lua programs, using library bindings such as LuaQt, and Lua's QMT bindings.
I primarily use Lua with the LÖVE engine to create 2d games. I am working on a commercial one with it atm! We will see how that works out.

Once my two hours is up, I plan on writing a Lua tut or two.
If you do decide to use it, then feel free to PM me. I can help you out.

Anyhow, happy language hunting, and happy learning!

JesseH

Thank you.

I was thinking about it a while ago since I play CSS there are so many things to do with it

Thank you for the offer and I will get back to you if i do decide to do it.

[Linuxephus™]

Thank you.
I was thinking about it a while ago since I play CSS there are so many things to do with it
Thank you for the offer and I will get back to you if i do decide to do it.

*Setkeh* is a world reigning Lua Expert.
If you want to learn advanced Lua scripting, that'll be the gentleman to see.
He's created his own modified browser (web) for the internet among God only knows what else.
Just tell him privately that I sent you.
Bear in mind I was (willingly, infer my own freewill) banned from the LinuxDistroCommunity Dot Com for Reality Checking an individual there.
So publicly it will appear to be a matter of the "cold shoulder". That is a must to maintain public appearances on the subject.
You can also find him in the #Linuxdistrocommunity IRC Channel on Freenode if need be.

Footnote: Should personal questions on this matter arise, see *Valtam* on the subject as this Reality Check was a necessity that I voluntarily took upon myself knowing the potential consequences which in turn resulted in the both of us (infer the other individual in question) taking a voluntary ban (I have a way with words).
Posted as a factual account to avoid any junior providences from suddenly becoming a "know it all".

[JesseH]

Hey,
I may contact this guy myself, he seems like a pretty interesting fellow.

JesseH

[BunnyJ]

I found this site.. http://codegolf.com/. It has a variety of assignments that can be done in just about any language. I've done a few in C++ and Python.

There are good ones:
1. Convert Decimal value to binary
2, Convert Binary value to decimal
3. Convert a Roman Numeral to decimal
4. Convert Hex to Decimal

Oh and this old but great one:
http://codegolf.com/tower-of-hanoi

The Problem

The Tower of Hanoi puzzle was invented by Edouard Lucas in 1883. It consists of three pegs, and a number of disks of varying sizes which can slide onto the pegs.

Traditionally, the puzzle starts with the disks stacked in order of size on one peg, which the smallest disk at the top. The objective is to move the entire stack to another peg, obeying these simple rules:

Only one disk can be moved at a time.
You can only move the top-most disk off one of the pegs, and place it on top of disks which may already be present another peg.
You cannot place a disk on top of a smaller disk.

For more information about the puzzle, including images of the puzzle and various methods of solving it computationally, see the Tower of Hanoi Wikipedia page. Note that because of some of our tests, your solution will have to be capable of starting with the disks being in any valid arrangement.

And here's an example of what it does:
http://codegolf.com/competition/run/27/1

Tower of Hanoi
To recurse, or not to recurse, that is the question.
Run 1
Input

321


Possible Output

Remember, for this challenge, there might be more than one valid output.

1 to C
2 to B
1 to B
3 to C
1 to A
2 to C
1 to C

HTH
Jeff