Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
1999
*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 1999

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

Search the Archive

Re: RE: easiest way to sort a list?

  • To: mathgroup at smc.vnet.net
  • Subject: [mg18336] Re: [mg18323] RE: [mg18308] easiest way to sort a list?
  • From: "Andrzej Kozlowski" <andrzej at tuins.ac.jp>
  • Date: Sun, 27 Jun 1999 15:11:23 -0400
  • Sender: owner-wri-mathgroup at wolfram.com

The following seems to me to be a somewhat simpler version of the same idea:

In[1]:=
orderedUnion[l_]:=
  Sort[Union[l],Position[l,#1,{1}][[1,1]]<Position[l,#2,{1}][[1,1]]&]

E.g.

In[2]:=
orderedUnion[{{c,c},{c,c},3,3,2,2,a,{x,y},{x,y},c,c,a}]
Out[2]=
{{c, c}, 3, 2, a, {x, y}, c}
--
Andrzej Kozlowski
Toyama International University
JAPAN
http://sigma.tuins.ac.jp
http://eri2.tuins.ac.jp


----------
>From: "Ersek, Ted R" <ErsekTR at navair.navy.mil>
To: mathgroup at smc.vnet.net
>To: mathgroup at smc.vnet.net
>Subject: [mg18336] [mg18323] RE: [mg18308] easiest way to sort a list?
>Date: Sun, Jun 27, 1999, 8:08 AM
>

> Peter (peterw at cco.caltech.edu) wrote:
> -------------------
> Suppose you have a list of integers, not all distinct, say
>       {1, 5, 3, 5, 10, 10, 1},
>
> and you want to obtain the list
>
>       {1, 5, 3, 10}
>
> which is the set of distinct elements but with the order preserved; i.e.,
> the order in which the elements in the second list appear is the same as
> the order in which it first occurs in the first list.  What is a simple
> way to do this?  Evidently Union[] sorts the elements in canonical order,
> which is not desirable.  My current solution is so messy that I suspect
> there must be an easier way.
>
> ------------------------
>
> Peter,
>
> Robby Villegas posted a slick solution to this problem in this newsgroup.
> See [mg8265] from 23, August 1997.
> -----------------------
>
> In[1]:=
> RestoreOrder[subset_, list_] := Last /@ Sort[ {Position[list, #, {1}, 1][[1,
> 1]], #}& /@ subset ] ;
> EliminateRepetition[list_List] := RestoreOrder[Union[list], list]
>
> In[3]:=
> EliminateRepetition[{1,5,3,5,10,10,1}]
>
> Out[3]=
> {1,5,3,10}
>
>
> This works for any list, not just a list of integers, numbers, etc.
>
> Regards,
> Ted Ersek


  • Prev by Date: Re: easiest way to sort a list?
  • Next by Date: Need just enough underbars
  • Previous by thread: Re: easiest way to sort a list?
  • Next by thread: Re: Re: easiest way to sort a list?