Timeline for Finding all points that are located in one line in 2D coordinate system
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 14, 2013 at 7:15 | vote | accept | user99295 | ||
| Aug 12, 2013 at 16:36 | vote | accept | user99295 | ||
| Aug 12, 2013 at 16:36 | |||||
| Aug 12, 2013 at 12:05 | comment | added | mouviciel | Some hints can be found on Wikipedia's Dot Product. | |
| S Aug 12, 2013 at 11:51 | history | suggested | Bernhard Barker | CC BY-SA 3.0 |
Inlined image
|
| Aug 12, 2013 at 11:48 | review | Suggested edits | |||
| S Aug 12, 2013 at 11:51 | |||||
| Aug 11, 2013 at 18:36 | comment | added | user99295 | I have no idea other than brute-force. O(n^3) because max points count is 1000. 10^3 * 10^3 * 10^3 is 10^9 = I suppose the online checker won't accept anything more than that. But.. it's only a guessing. | |
| Aug 11, 2013 at 17:37 | answer | added | mhoran_psprep | timeline score: 2 | |
| Aug 11, 2013 at 17:32 | comment | added | user28988 | What have you tried so far? What makes you think this is an (n^3)+ problem for instance? | |
| Aug 11, 2013 at 17:21 | review | First posts | |||
| Aug 11, 2013 at 18:23 | |||||
| Aug 11, 2013 at 17:03 | history | asked | user99295 | CC BY-SA 3.0 |