Reputation
1,403
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
3 11 26
Impact
~66k people reached

7h
comment How can the containsKey() method of a Java Hash Table be O(1)?
@kevincline no I didn't, obviously :) - otherwise why would I have made this question?? Also, what does it matter that Wikipedia has the answer? If the question is not a duplicate then it should be fine to post it, regardless of how trivial it may be. Heck, many good questions in Stack Exchange have answers in Wikipedia so I don't see the problem. You make it sound like trivial/easy questions are not okay, when they clearly are.
15h
comment How can the containsKey() method of a Java Hash Table be O(1)?
@gnat I can see a close answer there: that the hash table computes the hashcode into a number that corresponds to an array's index - but what if two keys just so happen to generate the same hashcode? Surely that wouldn't be O(1)?
16h
asked How can the containsKey() method of a Java Hash Table be O(1)?
Jul
28
awarded  Famous Question
Mar
23
awarded  Great Question
Mar
23
awarded  Favorite Question
Mar
21
comment When is it a good idea to force garbage collection?
@Chloe isn't System.gc() just a suggesstion in the JVM?
Mar
19
comment When is it a good idea to force garbage collection?
@DavidConrad you can force it in C#. Hence the question.
Mar
18
awarded  Notable Question
Mar
18
awarded  Mortarboard
Mar
18
accepted When is it a good idea to force garbage collection?
Mar
18
awarded  Good Question
Mar
18
awarded  Popular Question
Mar
18
awarded  Nice Question
Mar
18
comment When is it a good idea to force garbage collection?
Can someone point out the reason of the downvote? I myself don't know enough to judge the answer (at first glance it kinda makes sense to me).
Mar
17
asked When is it a good idea to force garbage collection?
Mar
4
awarded  Nice Question
Mar
3
awarded  Famous Question
Mar
2
awarded  Yearling
Mar
2
accepted How does branch prediction work, if you still have to check for the conditions?