Upload
Login or register

crilleballe

Last status update:
-
Date Signed Up:4/10/2011
Stats
Comment Ranking:#15287
Highest Content Rank:#14233
Highest Comment Rank:#2182
Content Thumbs: 40 total,  112 ,  72
Comment Thumbs: 5277 total,  6443 ,  1166
Content Level Progress: 74.57% (44/59)
Level 0 Content: Untouched account → Level 1 Content: New Here
Comment Level Progress: 95% (95/100)
Level 249 Comments: Doinitrite → Level 250 Comments: Contaminated Win
Subscribers:0
Content Views:8091
Total Comments Made:1669
FJ Points:1344

latest user's comments

#43 - I see your kjöttbullar and raise my frikadeller  [+] (1 reply) 02/20/2016 on Denmark declaring war on... +1
#44 - anon (02/20/2016) [-]
#45 - Picture 02/17/2016 on knightmares +7
#5 - Picture  [+] (1 reply) 02/15/2016 on (untitled) +164
#53 - spoperman (02/15/2016) [-]
#52 - Im gonna be honest and say that i have no idea what the code y…  [+] (1 reply) 02/01/2016 on old school nerd memes 0
User avatar
#54 - kaboomz (02/01/2016) [-]
its visual basic with a bit of linq in it
basically you declare 3 lists where we say the first one already has the items (disks)
then grab the items from the first one, order by the bottom ones and place them on the second list one by one (loop)
then the same for the last one

instead of a function calling itself i used fors (loop)
i never heard of Hanoi's tower and i never used recursive functions
#50 - If you don't know what Hanoi's tower is, here is a TL R of i…  [+] (4 replies) 02/01/2016 on old school nerd memes +1
#51 - kaboomz (02/01/2016) [-]
>A function that calls itself, typically multiple times, to get a result.

that doesnt sound good at least to me
then again im a vbfag

Sub MoveDisks()
' Poles
Dim PoleOne As New List(Of Disk)
Dim PoleTwo As New List(Of Disk)
Dim PoleThree As New List(Of Disk)

' Get all the first pole disks and place the bottom ones first on the second one
For Each D As Disk In (From x In PoleOne).OrderByDescending(Function(x) x.Size)
PoleTwo.Add(D)
Next

' Get all the second pole disks and place the bottom ones first on the third one
For Each D As Disk In (From x In PoleTwo).OrderByDescending(Function(x) x.Size)
PoleThree.Add(D)
Next
End Sub
User avatar
#53 - Lilstow (02/01/2016) [-]
recursion isn't technically necessary ever you can just use a loop. , but sometimes it's just easier/more logical
it's also one of those things that's kinda hard to explain when it's useful, and you often just need to do a bunch of problems where it's useful in order to figure it out.
#52 - crilleballe (02/01/2016) [-]
Im gonna be honest and say that i have no idea what the code you just wrote does. I am not at all proficient with many languages. What language is it?
The idea of recursive functions is not that it should be fast running or super genius, it's just a way to save time by writing very little code and using it over and over again.
Also, apparently, the answer to how many moves you need to solve Hanoi's Tower for n disks, is just 2^n - 1, as i just found out on wikipedia
User avatar
#54 - kaboomz (02/01/2016) [-]
its visual basic with a bit of linq in it
basically you declare 3 lists where we say the first one already has the items (disks)
then grab the items from the first one, order by the bottom ones and place them on the second list one by one (loop)
then the same for the last one

instead of a function calling itself i used fors (loop)
i never heard of Hanoi's tower and i never used recursive functions
#49 - A function that calls itself, typically multiple times, to get…  [+] (5 replies) 02/01/2016 on old school nerd memes +2
#50 - crilleballe (02/01/2016) [-]
If you don't know what Hanoi's tower is, here is a TLR of it:
Move all disks from one pole to another pole.
You can only move one disk at a time.
A bigger disk cannot lie on top of a smaller disk.
You must move a disk from one pole to another pole.
#51 - kaboomz (02/01/2016) [-]
>A function that calls itself, typically multiple times, to get a result.

that doesnt sound good at least to me
then again im a vbfag

Sub MoveDisks()
' Poles
Dim PoleOne As New List(Of Disk)
Dim PoleTwo As New List(Of Disk)
Dim PoleThree As New List(Of Disk)

' Get all the first pole disks and place the bottom ones first on the second one
For Each D As Disk In (From x In PoleOne).OrderByDescending(Function(x) x.Size)
PoleTwo.Add(D)
Next

' Get all the second pole disks and place the bottom ones first on the third one
For Each D As Disk In (From x In PoleTwo).OrderByDescending(Function(x) x.Size)
PoleThree.Add(D)
Next
End Sub
User avatar
#53 - Lilstow (02/01/2016) [-]
recursion isn't technically necessary ever you can just use a loop. , but sometimes it's just easier/more logical
it's also one of those things that's kinda hard to explain when it's useful, and you often just need to do a bunch of problems where it's useful in order to figure it out.
#52 - crilleballe (02/01/2016) [-]
Im gonna be honest and say that i have no idea what the code you just wrote does. I am not at all proficient with many languages. What language is it?
The idea of recursive functions is not that it should be fast running or super genius, it's just a way to save time by writing very little code and using it over and over again.
Also, apparently, the answer to how many moves you need to solve Hanoi's Tower for n disks, is just 2^n - 1, as i just found out on wikipedia
User avatar
#54 - kaboomz (02/01/2016) [-]
its visual basic with a bit of linq in it
basically you declare 3 lists where we say the first one already has the items (disks)
then grab the items from the first one, order by the bottom ones and place them on the second list one by one (loop)
then the same for the last one

instead of a function calling itself i used fors (loop)
i never heard of Hanoi's tower and i never used recursive functions
#5 - Picture  [+] (11 replies) 01/15/2016 on Money from Gaming, Movies,... +137
#86 - dreygur (01/16/2016) [-]
"I need some dosh right now"

MONEY MONEY MONEY LOADSA MONEY IT'S RAINING MONEY WHO NEEDED MONEY
User avatar
#120 - underthefilth (01/16/2016) [-]
Got source for the comic?
User avatar
#141 - dreygur (01/16/2016) [-]
Nah, sorry
#83 - burdenedsoul (01/16/2016) [-]
#62 - tropenthatshtup (01/16/2016) [-]
Grab it while ya can!
#60 - furiousmarshmellow (01/16/2016) [-]
LET'S GO SHOPPIN', CHAPS
#58 - furiousmarshmellow has deleted their comment.
#38 - therealrainbowdash (01/16/2016) [-]
#36 - iyr (01/16/2016) [-]
#30 - pictureperfectt (01/16/2016) [-]
SING 'A SONG 'A SIX PENCE AH BOOKIT FULLA DOSH
DIBBLE DIBBLE DIBBLE DIBBLE BOSH BOSH BOSH
#7 - borderlineparanoid (01/15/2016) [-]
GET YER WAD OUT