Timeline for Taking intersection in large search
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 27, 2016 at 21:01 | vote | accept | Little Alien | ||
| May 27, 2016 at 19:20 | answer | added | D.W.♦ | timeline score: 0 | |
| May 27, 2016 at 16:34 | history | edited | Little Alien | CC BY-SA 3.0 |
deleted 36 characters in body
|
| May 27, 2016 at 15:53 | history | edited | Little Alien | CC BY-SA 3.0 |
added 70 characters in body
|
| May 27, 2016 at 12:23 | history | edited | Little Alien | CC BY-SA 3.0 |
added 105 characters in body
|
| May 27, 2016 at 12:10 | comment | added | Raphael | What's the real question here? "how does Google work?" or "how can I implement sets so that intersection is efficient"? | |
| May 27, 2016 at 12:09 | comment | added | Raphael | "indexed search has complexity O(1)" -- wrong. Who says that? | |
| May 27, 2016 at 10:59 | history | edited | Little Alien | CC BY-SA 3.0 |
added 159 characters in body
|
| May 27, 2016 at 10:17 | comment | added | adrianN | Yes, you need to take the intersection. What's your question? | |
| May 27, 2016 at 10:12 | history | asked | Little Alien | CC BY-SA 3.0 |