Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.javascript > #8026
| From | Dr J R Stockton <reply1144@merlyn.demon.co.uk> |
|---|---|
| Newsgroups | comp.lang.javascript |
| Subject | Re: sorting columns |
| Date | 2011-11-04 21:00 +0000 |
| Organization | Home |
| Message-ID | <UW+KcZH1JFtOFwYf@invalid.uk.co.demon.merlyn.invalid> (permalink) |
| References | <f7fca7c8-769a-4339-ae49-bda395338ef3@l12g2000vby.googlegroups.com> <mqUGzLEbPZsOFwUD@invalid.uk.co.demon.merlyn.invalid> <j8uonk$v6j$1@news.albasani.net> |
In comp.lang.javascript message <j8uonk$v6j$1@news.albasani.net>, Thu, 3 Nov 2011 20:06:35, Andreas Bergmaier <andber93@web.de> posted: >Dr J R Stockton schrieb: >> Why sort a<table>? >Why not? Because sorting an N-element list requires something like 2 N log N individual element reads, and maybe N log N element writes. For those, the sort algorithms refer to an element by its index number. Therefore, if the number of rows may be large, one wants to optimise the speed of each of the N log N steps of the sort. Using an array for the rows will provide the simplest access to the elements being sorted. Using arrays for the data within the rows will provide simple access to the items to be compared. If the columns are numbered 1 to J, then the sort keys could be stored in Column 0, for ready access. >> Supply the data in JavaScript, as a "two-dimensional array" >> Arr[[..., ..., ... ], [...], [...], [...], ... [...]] ; >> >> At need, sort that. Then remove any existing Table, build the new Table >> using DOM methods, and insert the new Table. > >What do you mean with two-dimensional array? Does it represent the cell >data, or does each second-level-array contain the relevant cell content >(of the column you want to sort) and a reference to the row element? I meant that the elements of the array, if written out in the usual two- dimensional form, would look like the actual table elements on screen. > I guess it would be faster to store the dom elements, instead of >rebuilding them. That, I think, will depend strongly on the number of rows in the array; one *must* have easy access to the values to be compared. If it is large, the only important thing is to optimise the actual sorting. If it is small, the whole thing will take very little time anyway. -- (c) John Stockton, nr London, UK. ?@merlyn.demon.co.uk Turnpike v6.05. Website <http://www.merlyn.demon.co.uk/> - w. FAQish topics, links, acronyms PAS EXE etc. : <http://www.merlyn.demon.co.uk/programs/> - see in 00index.htm Dates - miscdate.htm estrdate.htm js-dates.htm pas-time.htm critdate.htm etc.
Back to comp.lang.javascript | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
sorting columns fulio pen <fuliopen@yahoo.com> - 2011-11-01 06:14 -0700
Re: sorting columns Elegie <elegie@anonymous.invalid> - 2011-11-01 20:18 +0100
Re: sorting columns fulio pen <fuliopen@yahoo.com> - 2011-11-02 05:07 -0700
Re: sorting columns Elegie <elegie@anonymous.invalid> - 2011-11-02 13:46 +0100
Re: sorting columns fulio pen <fuliopen@yahoo.com> - 2011-11-02 07:39 -0700
Re: sorting columns Elegie <elegie@anonymous.invalid> - 2011-11-02 16:00 +0100
Re: sorting columns fulio pen <fuliopen@yahoo.com> - 2011-11-02 11:06 -0700
Re: sorting columns Dr J R Stockton <reply1144@merlyn.demon.co.uk> - 2011-11-02 19:02 +0000
Re: sorting columns Elegie <elegie@anonymous.invalid> - 2011-11-03 02:27 +0100
Re: sorting columns Andreas Bergmaier <andber93@web.de> - 2011-11-03 20:06 +0100
Re: sorting columns Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2011-11-03 20:41 +0100
Re: sorting columns Dr J R Stockton <reply1144@merlyn.demon.co.uk> - 2011-11-04 21:12 +0000
Re: sorting columns Dr J R Stockton <reply1144@merlyn.demon.co.uk> - 2011-11-04 21:00 +0000
Re: sorting columns Dr J R Stockton <reply1144@merlyn.demon.co.uk> - 2011-11-03 21:03 +0000
csiph-web