Timeline for How to analyze a randomized recursive algorithm?
Current License: CC BY-SA 3.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 7, 2012 at 17:57 | comment | added | Saeed | Nice clarification and good question in the end, many thanks. | |
| Nov 7, 2012 at 17:45 | history | edited | Neal Young | CC BY-SA 3.0 |
added 3 characters in body
|
| Nov 7, 2012 at 16:46 | history | edited | Neal Young | CC BY-SA 3.0 |
added 1091 characters in body
|
| Nov 7, 2012 at 16:13 | comment | added | Neal Young | You're welcome! I'll edit the proof to clarify the points you raise.. | |
| Nov 7, 2012 at 8:24 | comment | added | Saeed | Thank you very much, this is really interesting and clever idea. Just for a side note, we can use your idea for partitioning d-dimensional array. Just about the part you said children are making $K\times K$ grid, actually they divide the parent in $K^2$ part of rectangles, not necessary same size parts, so they wont make a grid, but still your $2/3$ argument holds about perimeters of parent over total children. Also I couldn't get how if we replace $O(m+n)$ with $O(mn)$ as extra cost of each run, still we have $O(mn)$ total running time. Again thank you very much for very clever idea. | |
| Nov 6, 2012 at 18:44 | vote | accept | Saeed | ||
| Nov 5, 2012 at 4:11 | history | edited | Neal Young | CC BY-SA 3.0 |
deleted 8 characters in body
|
| Nov 3, 2012 at 23:34 | history | edited | Neal Young | CC BY-SA 3.0 |
added 67 characters in body
|
| Nov 3, 2012 at 17:24 | history | edited | Neal Young | CC BY-SA 3.0 |
added 273 characters in body
|
| Nov 3, 2012 at 17:16 | history | edited | Neal Young | CC BY-SA 3.0 |
added 273 characters in body
|
| Nov 3, 2012 at 1:42 | history | undeleted | Neal Young | ||
| Nov 3, 2012 at 1:42 | history | edited | Neal Young | CC BY-SA 3.0 |
added 1800 characters in body
|
| Nov 2, 2012 at 19:19 | history | deleted | Neal Young | ||
| Nov 2, 2012 at 19:17 | history | edited | Neal Young | CC BY-SA 3.0 |
added 88 characters in body
|
| Nov 2, 2012 at 19:06 | history | edited | Neal Young | CC BY-SA 3.0 |
added 42 characters in body
|
| Nov 2, 2012 at 19:00 | history | edited | Neal Young | CC BY-SA 3.0 |
added 135 characters in body
|
| Nov 2, 2012 at 18:55 | history | answered | Neal Young | CC BY-SA 3.0 |