MathGroup Archive 2001

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

Search the Archive

RE: Best code to match corresponding list items?

  • To: mathgroup at smc.vnet.net
  • Subject: [mg27758] RE: [mg27729] Best code to match corresponding list items?
  • From: "David Park" <djmp at earthlink.net>
  • Date: Wed, 14 Mar 2001 04:06:56 -0500 (EST)
  • Sender: owner-wri-mathgroup at wolfram.com

Roger,

In this case I think you overlooked the simple solution.

alist = Array[a, 10];
blist = Array[b, 10];

Transpose[{alist, blist}]
{{a[1], b[1]}, {a[2], b[2]}, {a[3], b[3]}, {a[4], b[4]}, {a[5], b[5]},
{a[6],
    b[6]}, {a[7], b[7]}, {a[8], b[8]}, {a[9], b[9]}, {a[10], b[10]}}

You can include as many lists as you want, as long as they are all the same
length.

David Park
djmp at earthlink.net
http://home.earthlink.net/~djmp/


> From: Roger Ison [mailto:rison at ix.netcom.com]
To: mathgroup at smc.vnet.net
>
> Given two lists
> A={a1,a2,a3,...}
> B={b1,b2,b3...}
>
> I want to produce the list
> C={  {a1,b1}, {a2,b2}, {a3,b3}...}  }
> as efficiently as possible.
> Better yet, generalize to do this with N lists all of same length.
>
> Obviously it can be done directly with Table, but is there a more elegant,
> implicit way to write it that doesn't involve passing a function to Table
> and using an explicit index? Is there a general functional primitive for
> this that I simply haven't found? Seems like something so common, there
> ought to be a built-in function for it.
>
> Thanks,
> Roger
>



  • Prev by Date: Re: ExtendGraphics LabelContour Error Message
  • Next by Date: Re: Best code to match corresponding list items?
  • Previous by thread: Re: Best code to match corresponding list items?
  • Next by thread: Re: Best code to match corresponding list items?