Re: when dimension increases
- To: mathgroup at smc.vnet.net
- Subject: [mg67567] Re: when dimension increases
- From: dh <dh at metrohm.ch>
- Date: Sat, 1 Jul 2006 05:11:44 -0400 (EDT)
- References: <e82n4s$qvr$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Hi, you can still use Map and Sort, but you have to tell Map on which level to apply Sort. E.g.: Map[Sort,listNew1,Depth[listNew1]-2] or Map[Sort,listNew1,{Depth[listNew1]-2}] depending on which levels you want to sort. Daniel Arkadiusz Majka wrote: > Hi, > > Imagine that I want to sort (or do anything else) a list > > list={5,2,8,3} > > So I use Sort[list] > > Next I add next dimension and obtain a list listNew=Table[list,{5}] > > In order to sort all sublists of it it I use Map[Sort, listNew] > > Now I add another more dimension listNew1=Table[list, {3},{5}] > > I can again sort all sublists of it using combination of Table and Map. > > The question is the following: > > How can I deal with expresions of unknown a priori dimension? For > example what is the most elegant (clear and fast) method of sorting all > sublists of multidimensional expresion? I would like to avoid Table and > unclear expresions with many "Maps" (one embeded in another). > > Thanks for your help, > > Arek >