Timeline for calculate complexity of LinkedHashSet
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 9, 2014 at 3:56 | history | edited | user40980 |
edited tags
|
|
| Jun 19, 2014 at 10:56 | answer | added | InformedA | timeline score: 0 | |
| Jun 18, 2014 at 15:29 | history | edited | user40980 | CC BY-SA 3.0 |
Fix curly braces, indent, 'i'.
|
| Jun 18, 2014 at 13:25 | vote | accept | OiRc | ||
| Jun 18, 2014 at 13:25 | review | First posts | |||
| Jun 18, 2014 at 15:30 | |||||
| Jun 18, 2014 at 13:16 | answer | added | Neil | timeline score: 5 | |
| Jun 18, 2014 at 13:14 | comment | added | OiRc | @EugenePodskal i know, in this case the search of the string using contains is o(n) or it run in constant time. | |
| Jun 18, 2014 at 13:12 | comment | added | Eugene Podskal | The problem is that hashtable-based collections have average cases and worst cases en.wikipedia.org/wiki/Hash_table. | |
| Jun 18, 2014 at 13:10 | comment | added | OiRc | i mean o-complexity. | |
| Jun 18, 2014 at 13:09 | comment | added | Eugene Podskal | What do you mean with complexity? Is it o-complexity en.wikipedia.org/wiki/Time_complexity? Or do you mean average amortized time en.wikipedia.org/wiki/Amortized_analysis? | |
| S Jun 18, 2014 at 13:08 | history | suggested | Colonel Thirty Two | CC BY-SA 3.0 |
Grammar fixes, removed unnecessary emphasis
|
| Jun 18, 2014 at 13:08 | review | Suggested edits | |||
| S Jun 18, 2014 at 13:08 | |||||
| Jun 18, 2014 at 13:05 | history | asked | OiRc | CC BY-SA 3.0 |