Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2014

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: For 2014?

  • To: mathgroup at smc.vnet.net
  • Subject: [mg132185] Re: For 2014?
  • From: Boguś <telemorele at wp.pl>
  • Date: Sun, 12 Jan 2014 02:32:03 -0500 (EST)
  • Delivered-to: l-mathgroup@mail-archive0.wolfram.com
  • Delivered-to: l-mathgroup@wolfram.com
  • Delivered-to: mathgroup-outx@smc.vnet.net
  • Delivered-to: mathgroup-newsendx@smc.vnet.net
  • References: <20131224071749.C3F1A69D5@smc.vnet.net> <3688DC0E-CE14-47F1-B93B-5BFA875C59E3@data2knowledge.de> <20131226112449.4994F6A09@smc.vnet.net> <644455E9-F8F1-491C-9EFE-1198A90B8FED@wolfram.com> <la606o$faj$1@smc.vnet.net> <20140107075437.D0DF569ED@smc.vnet.net> <lao80v$pmm$1@smc.vnet.net>

Ulrich Arndt  wrote:
> Yes, this is much faster - 5 times on my machine.
> Problem is that we get 141 chars even if we replace the re by b ;-).
>
> But can someone explain the reason for the huge processing time difference?
>
> Ulrich
>

 
l=Range[9];r=StringJoin[Riffle[ToString/@l,#]]&/@Tuples[{"+","-","*","/",""},8];Grid[{#,Extract[r,Position[ToExpression/@r,#]]}&/@(l+2010)]

Position[ToExpression/@r,#]
            ^^^^^ This is the slowest process. 9 times repeated

-- 
  Costa



  • Follow-Ups:
    • Re: For 2014?
      • From: Ulrich Arndt <ulrich.arndt@data2knowledge.de>
  • Prev by Date: Re: Compact formulation of array of constraints
  • Next by Date: Re: Number Interpretation
  • Previous by thread: Re: For 2014?
  • Next by thread: Re: For 2014?