Reputation
1,413
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
3 11 27
Impact
~69k people reached

Aug
20
awarded  Autobiographer
Aug
5
comment How can the containsKey() method of a Java Hash Table be O(1)?
@Frisbee Or this: Why do we need private variables? (programmers.stackexchange.com/questions/143736/…). It's a good question, but under your logic, it is not worth posting because clearly the benefits of private variables are well-established and well-documented. Anyone with a little searching would have immediately found out the pros and cons quickly.
Aug
5
comment How can the containsKey() method of a Java Hash Table be O(1)?
@Frisbee An additional example, and my favourite, is this: "What does the Spring Framework do?" (programmers.stackexchange.com/questions/92393/…) - are you really going to tell me this question is not generic? That it's not possible to find out by Googling it? Yet, it is still a good and useful question.
Aug
5
comment How can the containsKey() method of a Java Hash Table be O(1)?
@Frisbee how an array works is not trivial but it is well established, and yet programmers.stackexchange.com/questions/252407/…. The same for many, many other Stack Exchange questions. You are merely trying to expose this question as particularly bad, ignoring the fact that several (good) questions were made under the same circumstances. That is laughable.
Aug
4
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.
Aug
4
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)?
Aug
4
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?