MathGroup Archive 2006

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

Search the Archive

Re: Insertion into sorted list


Hi,

SortedInsert[lst_, elem_] :=
  Block[{less},
  less = Select[lst, # < elem &];
  Join[Select[lst, # < elem &], {elem}, 
Complement[lst, less]]
 ]

lst = {1, 2, 4, 8, 16};

SortedInsert[lst,5]

Regards

  Jens

"Andrew Moylan" <andrew.j.moylan at gmail.com> 
schrieb im Newsbeitrag 
news:eimq10$9b7$1 at smc.vnet.net...
| Hi all,
|
| I have a sorted List. I need to occasionally 
insert new elements, while
| always keeping the list sorted. Is there a more 
efficient way to do
| this than the most obvious way (calling Append 
then calling Sort)?
|
| Thanks for any help,
|
| Andrew
| 



  • Prev by Date: Re: Subscript assignment incompatibility??
  • Next by Date: Re: Points sampled by FindMinimum
  • Previous by thread: Re: Insertion into sorted list
  • Next by thread: Possible simple bug in NMaximize