Timeline for Fastest square number test
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:55 | history | edited | CommunityBot |
replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/
|
|
| Oct 24, 2012 at 22:26 | review | Suggested edits | |||
| Oct 24, 2012 at 22:35 | |||||
| Jan 21, 2012 at 20:17 | comment | added | acl | @ruebenko that is a good point (in this case, though, they give the same answer, so I'll leave this the way it is--but your point about running them in parallel stands) | |
| Jan 21, 2012 at 17:49 | comment | added | user21 | Perhaps, you'd like to use AbsoluteTiming for these tests, especially if stuff is running in parallel. See the "How can I improve the speed of eigenvalue decompositions for large matrices?" thread. | |
| Jan 21, 2012 at 16:34 | comment | added | acl |
@Sal That's true, but I can't get the test faster. Looking at CompilePrint[isSq], it's hard to see anything more costly thatn Sqrt.
|
|
| Jan 21, 2012 at 16:25 | comment | added | Sal Mangano | True, but this does not speed up the sq test per se it is just a faster way to apply the function across a list than Table is. Good idea though! | |
| Jan 21, 2012 at 15:55 | history | answered | acl | CC BY-SA 3.0 |