Timeline for Complexity analysis: Finding common members of unsorted arrays
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23, 2015 at 13:29 | comment | added | Malt | Hash tables have a worst case access time of O(n). That means that this solution has a worst case run time of O(n^2) | |
| Feb 23, 2015 at 13:22 | comment | added | npinti | @Fogmeister: Yeah I was trying to create an answer which might not confuse future readers ;). Updated the answer. | |
| Feb 23, 2015 at 13:21 | history | edited | npinti | CC BY-SA 3.0 |
added 27 characters in body
|
| Feb 23, 2015 at 13:14 | comment | added | Fogmeister | Ah, no worries :D I've been cramming everything about complexity analysis. LOL! | |
| Feb 23, 2015 at 13:13 | comment | added | npinti |
@Fogmeister: Yes, I just did not want to induce any confusion as in where did the 2 go.
|
|
| Feb 23, 2015 at 13:08 | vote | accept | Fogmeister | ||
| Feb 23, 2015 at 13:20 | |||||
| Feb 23, 2015 at 13:08 | comment | added | Fogmeister |
Actually, that would be O(n) as constants are ignored as n tends to infinity :D Thanks, makes a lot of sense.
|
|
| Feb 23, 2015 at 12:18 | history | answered | npinti | CC BY-SA 3.0 |