Please Scroll Down to See Forums Below
napsgear
genezapharmateuticals
domestic-supply
puritysourcelabs
UGL OZ
UGFREAK
napsgeargenezapharmateuticals domestic-supplypuritysourcelabsUGL OZUGFREAK

If someone needs help from me tonight let me know.

coldblue1955

New member
Puzzleling questions,advice, or help you get that next level in the K department i'm here to help. I'm your friend and NOT your enemy. Let me prove it to ya!
 
I need help getting to the next level in the K department . . . I keep getting to the boss and I do a spinning back kick and knock him over but my fatigue is always too high and I can't hit him again before he gets back up and then he punches me once and I'm dead...
how do i get to the next level?
 
cyrex said:
I need help getting to the next level in the K department . . . I keep getting to the boss and I do a spinning back kick and knock him over but my fatigue is always too high and I can't hit him again before he gets back up and then he punches me once and I'm dead...
how do i get to the next level?
i'll see what i can do.
 
cyrex said:
I need help getting to the next level in the K department . . . I keep getting to the boss and I do a spinning back kick and knock him over but my fatigue is always too high and I can't hit him again before he gets back up and then he punches me once and I'm dead...
how do i get to the next level?
there is that better?
 
coldblue1955 said:
there is that better?

HOLY CRAP... that helped a lot... i did the kick and knocked him down but my fatigue wasn't too low. I nailed him in the nuts 6 times before he got up, but when he got up his eyes rolled in the back of his head and I did a coldblue death blow and he shattered! it was awesome...

Next level starts now...
 
hey coldblue.. i do need some help.

I need to write a pseudo code algorithm to solve the fibinocci sequence 3 different ways

First: Big 'O' notation is simply O*1.5
Second: Big 'O' notation is O^2
Third: Big 'O' notation is O^(ln 2 + 1)(ln 3 +1)^2(ln 5 + 1)(ln 7 + 1)(ln 17 + 1)^5
 
cyrex said:
HOLY CRAP... that helped a lot... i did the kick and knocked him down but my fatigue wasn't too low. I nailed him in the nuts 6 times before he got up, but when he got up his eyes rolled in the back of his head and I did a coldblue death blow and he shattered! it was awesome...

Next level starts now...
ummm I'm not fully sure of what you're saying but it was my pleasure to help out!
 
actually if you could do the algorithm in c-style pseudo code, it'd be much appreciated


or if you want to convert the algorithm to the following languages for me, you can do that also:
C
php
perl
ruby
scheme
cobol
fortran
Ada95
Pascal
javascript
 
cyrex said:
hey coldblue.. i do need some help.

I need to write a pseudo code algorithm to solve the fibinocci sequence 3 different ways

First: Big 'O' notation is simply O*1.5
Second: Big 'O' notation is O^2
Third: Big 'O' notation is O^(ln 2 + 1)(ln 3 +1)^2(ln 5 + 1)(ln 7 + 1)(ln 17 + 1)^5
I wish I could help you in this department but i'm brain dead on this issue.
 
coldblue1955 said:
I wish I could help you in this department but i'm brain dead on this issue.

the 2nd one is recursive if that helps? .....



grrr you mean I have to do it myself


BORING STUFF
 
cyrex said:
hey coldblue.. i do need some help.

I need to write a pseudo code algorithm to solve the fibinocci sequence 3 different ways

First: Big 'O' notation is simply O*1.5
Second: Big 'O' notation is O^2
Third: Big 'O' notation is O^(ln 2 + 1)(ln 3 +1)^2(ln 5 + 1)(ln 7 + 1)(ln 17 + 1)^5

actually

it's Fibonacci

0 1 1 2 3 5 8 13 and so on...

term equals the sum of the prior 2 terms. Final exam in Pascal included to code a Recursive Fibonacci function, something along the lines of Fibonacci(x) = Fibonacci(x-1) + Fibonacci(x-2)

Fuck, 10 years later I still remember that one question in that one exam... lol, the saddest part is that it took me that it takes the whole of 5 code lines to solve it (when done correctly, recursivity is a wonder)
 
Top Bottom