5,745 reputation
12240
bio website github.com/DanielWaterworth
location United Kingdom
age 22
visits member for 3 years, 7 months
seen 2 hours ago

Jun
2
awarded  Enlightened
Jun
2
awarded  Nice Answer
Feb
12
awarded  Notable Question
Dec
14
awarded  Yearling
Dec
11
comment Is there any sorting algorithm which is not inherently sequential and is task distributable?
Does mergesort fit your criteria?
Dec
11
comment Is there any sorting algorithm which is not inherently sequential and is task distributable?
What do you mean by task distributable?
Nov
3
comment Junior developer introduction to job industry
Re 2, football players aren't paid per match and training certainly isn't something they only do in their spare time.
Oct
24
comment What are the tools required to build a compiler?
@kevin, meet LLVM, your new best friend.
Aug
19
comment Is it possible to represent mutation of object-graph efficiently with immutable states?
broad trees like B-trees tend to be used when the latency to the storage medium is high. In this case, you might be better off with something narrower, but yes, some kind of balanced search tree would be a good idea.
Aug
16
comment Is it possible to represent mutation of object-graph efficiently with immutable states?
It doesn't have to be a list.
Aug
12
comment Is it possible to represent mutation of object-graph efficiently with immutable states?
It's only difficult because you are putting the edges on the nodes. If you stored the edges externally, in an immutable collection, it would be easy.
Jul
22
awarded  Cleanup
Jul
22
revised Do you care if the person you're interviewing owns or contributes to Open Source projects?
rolled back to a previous revision
Jul
10
awarded  Necromancer
Jul
9
revised What does “branching is free” mean in Git?
added 5 characters in body
Jul
9
awarded  Nice Answer
Jul
5
comment What is the ideal length of a method?
1/7th of a brain-full.
Jun
28
awarded  Guru
Jun
28
comment How do functional languages handle random numbers?
I don't see how creating an infinite list of random numbers is easier to work with than function like: pseudoRandom :: Seed -> (Seed, Integer). You might even end up writing a function of this type [Integer] -> ([Integer], Integer)
Jun
27
awarded  Good Answer