Conversation Between Blah and karatekid552
Showing Visitor Messages 496 to 510 of 683
So you upgraded to an iso? Traiter.
February 6th, 2013 8:11 AM
Blah
Maybe because the location of my existence is beyond HUMANLY CONCEIVABLE Unlike many of my predecessors, I'm not limited to the confines of a mere ROM.
By the way, your location is far beyond the rom.... I didn't count right, you're in the almost 2 gig range, way out there.
Why should I feel so-so? I haven't gotten there yet. Someday.... Someday I'll be giving the challenges!
February 5th, 2013 6:44 PM
Blah
It's k bro-bro. I already did it, so you can feel so-so.
Come on man, I don't know this stuff yet. I'll figure it out.
February 5th, 2013 3:21 PM
Blah
Da fuk u get stuck on warm up exercise.
Okay, I know that too. Now, I just need to use it...
February 5th, 2013 3:08 PM
Blah
Lesson on permutations:
A word x, of length y, has y! permutations.
ex:
word = "cat"
length = 3
# permutations = 3! (factorial)
permutations of cat:
atc, tca, act, cta, cat, tac
It's the permutations part. I got this boi, I'll get it for you.
I know what you mean by recusion, though.
February 5th, 2013 2:57 PM
Blah
Then you know functions already, wut you saying boi!
That was the lesson I had last night:)
February 5th, 2013 2:48 PM
Blah
I'll give you a free lesson.
Def function_name(paramaters):
'''
Doc string
'''
Function body
return x #Don't need to return anything, but normally you do
That is all a function really is.
Remember how I said I was learning... Well I just started learning functions last night and I'm teaching myself, so I'm not quite that good yet. Give me some time, and I think I will be able to do it.
February 5th, 2013 2:32 PM
Blah
Well, try this:
Create a function, given a word x that displays all the permutations of x. No repeats. Must be under 35 lines.
I'll give you a hint, use recursion.