Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2001
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2001

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

Search the Archive

Re: sort

  • To: mathgroup at smc.vnet.net
  • Subject: [mg30012] Re: sort
  • From: "Mariusz Jankowski" <mjkcc at usm.maine.edu>
  • Date: Sat, 21 Jul 2001 00:49:21 -0400 (EDT)
  • Organization: University of Southern Maine
  • References: <9j8ojc$5u6$1@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

Russell, Sort does exactly what you want. See example

In[28]:=
Sort[{{0, 3, 0}, {3, 0, 2}, {0, 3, 1}}]

Out[28]=
{{0, 3, 0}, {0, 3, 1}, {3, 0, 2}}



Mariusz


======================================
Mariusz Jankowski
University of Southern Maine
email: mjkcc at usm.maine.edu




"Russell Witte" <nails at asu.edu> wrote in message
news:9j8ojc$5u6$1 at smc.vnet.net...
> Does anybody now how to sort a matrix first by one column and then by
> another column (giving priority to the first column and sorting by
> second column only when there are ties in the first column).
>
> Please respond to nails at asu.edu
>
> Thank you,
> --Russ--
>



  • Prev by Date: Re: Integrate[Sqrt[Tan[x]], x]
  • Next by Date: Re: [Q] Generalized Partitions
  • Previous by thread: Re: sort
  • Next by thread: RE: sort