[Date Index]
[Thread Index]
[Author Index]
Re: How I can I optimize the following code in order to
*To*: mathgroup at smc.vnet.net
*Subject*: [mg125120] Re: How I can I optimize the following code in order to
*From*: Murray Eisenberg <murray at math.umass.edu>
*Date*: Wed, 22 Feb 2012 05:32:54 -0500 (EST)
*Delivered-to*: l-mathgroup@mail-archive0.wolfram.com
*References*: <201202211109.GAA08132@smc.vnet.net>
*Reply-to*: murray at math.umass.edu
I don't see the point of evaluating exactly the same expression 3000^2
times.
On 2/21/12 6:09 AM, Liwen Zhang wrote:
> How I can I optimize the following code in order to get very short
> running time?
>
> Time1 = AbsoluteTime[];
> n = 3000;
> Do[Do[x =
> Sin (45.0)*ArcSin (0.5)*Sqrt (5.0)*ArcTan (2.5555);, {n}], {n}];
> Time2 = AbsoluteTime[];
> Print[Time2 - Time1];
>
--
Murray Eisenberg murray at math.umass.edu
Mathematics & Statistics Dept.
Lederle Graduate Research Tower phone 413 549-1020 (H)
University of Massachusetts 413 545-2859 (W)
710 North Pleasant Street fax 413 545-1801
Amherst, MA 01003-9305
Prev by Date:
**LinkOpen problem**
Next by Date:
**Re: How I can I optimize the following code in order to**
Previous by thread:
**How I can I optimize the following code in order to get very short running time**
Next by thread:
**Re: How I can I optimize the following code in order to**
| |