Fast stable merging and sorting in constant extra space:
Abstract: "In an earlier research paper [HL1], we presented a novel, yet straightforward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. Constant of proportionality estimates and empirical testing reveal that this procedure is reasonably competitive wit...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Knoxville, TN
1990
|
| Schriftenreihe: | University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS
1990,106 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In an earlier research paper [HL1], we presented a novel, yet straightforward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. Constant of proportionality estimates and empirical testing reveal that this procedure is reasonably competitive with merge routines free to squander unbounded additional memory, making it particularly attractive whenever space is a critical resource. In this paper, we devise a relatively simple strategy by which this efficient merge can be made stable, and extend our results in a nontrivial way to the problem of stable sorting by merging We also derive upper bounds on our algorithms' constants of proportionality, suggesting that in some environments (most notably external file processing) their modest run-time premiums may be more than offset by the dramatic space savings achieved. |
| Beschreibung: | 24, 4 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009225174 | ||
| 003 | DE-604 | ||
| 005 | 19960215 | ||
| 007 | t | ||
| 008 | 940313s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24652117 | ||
| 035 | |a (DE-599)BVBBV009225174 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Langston, Michael |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Fast stable merging and sorting in constant extra space |c Michael Langston |
| 264 | 1 | |a Knoxville, TN |c 1990 | |
| 300 | |a 24, 4 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS |v 1990,106 | |
| 520 | 3 | |a Abstract: "In an earlier research paper [HL1], we presented a novel, yet straightforward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. Constant of proportionality estimates and empirical testing reveal that this procedure is reasonably competitive with merge routines free to squander unbounded additional memory, making it particularly attractive whenever space is a critical resource. In this paper, we devise a relatively simple strategy by which this efficient merge can be made stable, and extend our results in a nontrivial way to the problem of stable sorting by merging | |
| 520 | 3 | |a We also derive upper bounds on our algorithms' constants of proportionality, suggesting that in some environments (most notably external file processing) their modest run-time premiums may be more than offset by the dramatic space savings achieved. | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Sorting (Electronic computers) | |
| 810 | 2 | |a Computer Science Department: CS |t University of Tennessee <Knoxville, Tenn.> |v 1990,106 |w (DE-604)BV008903301 |9 1990,106 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006134283 | ||
Datensatz im Suchindex
| _version_ | 1804123668317470720 |
|---|---|
| any_adam_object | |
| author | Langston, Michael |
| author_facet | Langston, Michael |
| author_role | aut |
| author_sort | Langston, Michael |
| author_variant | m l ml |
| building | Verbundindex |
| bvnumber | BV009225174 |
| ctrlnum | (OCoLC)24652117 (DE-599)BVBBV009225174 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01873nam a2200313 cb4500</leader><controlfield tag="001">BV009225174</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960215 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24652117</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009225174</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Langston, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fast stable merging and sorting in constant extra space</subfield><subfield code="c">Michael Langston</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Knoxville, TN</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24, 4 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS</subfield><subfield code="v">1990,106</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In an earlier research paper [HL1], we presented a novel, yet straightforward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. Constant of proportionality estimates and empirical testing reveal that this procedure is reasonably competitive with merge routines free to squander unbounded additional memory, making it particularly attractive whenever space is a critical resource. In this paper, we devise a relatively simple strategy by which this efficient merge can be made stable, and extend our results in a nontrivial way to the problem of stable sorting by merging</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We also derive upper bounds on our algorithms' constants of proportionality, suggesting that in some environments (most notably external file processing) their modest run-time premiums may be more than offset by the dramatic space savings achieved.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sorting (Electronic computers)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: CS</subfield><subfield code="t">University of Tennessee <Knoxville, Tenn.></subfield><subfield code="v">1990,106</subfield><subfield code="w">(DE-604)BV008903301</subfield><subfield code="9">1990,106</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006134283</subfield></datafield></record></collection> |
| id | DE-604.BV009225174 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:26Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006134283 |
| oclc_num | 24652117 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 24, 4 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS |
| spelling | Langston, Michael Verfasser aut Fast stable merging and sorting in constant extra space Michael Langston Knoxville, TN 1990 24, 4 S. txt rdacontent n rdamedia nc rdacarrier University of Tennessee <Knoxville, Tenn.> / Computer Science Department: CS 1990,106 Abstract: "In an earlier research paper [HL1], we presented a novel, yet straightforward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. Constant of proportionality estimates and empirical testing reveal that this procedure is reasonably competitive with merge routines free to squander unbounded additional memory, making it particularly attractive whenever space is a critical resource. In this paper, we devise a relatively simple strategy by which this efficient merge can be made stable, and extend our results in a nontrivial way to the problem of stable sorting by merging We also derive upper bounds on our algorithms' constants of proportionality, suggesting that in some environments (most notably external file processing) their modest run-time premiums may be more than offset by the dramatic space savings achieved. Algorithms Sorting (Electronic computers) Computer Science Department: CS University of Tennessee <Knoxville, Tenn.> 1990,106 (DE-604)BV008903301 1990,106 |
| spellingShingle | Langston, Michael Fast stable merging and sorting in constant extra space Algorithms Sorting (Electronic computers) |
| title | Fast stable merging and sorting in constant extra space |
| title_auth | Fast stable merging and sorting in constant extra space |
| title_exact_search | Fast stable merging and sorting in constant extra space |
| title_full | Fast stable merging and sorting in constant extra space Michael Langston |
| title_fullStr | Fast stable merging and sorting in constant extra space Michael Langston |
| title_full_unstemmed | Fast stable merging and sorting in constant extra space Michael Langston |
| title_short | Fast stable merging and sorting in constant extra space |
| title_sort | fast stable merging and sorting in constant extra space |
| topic | Algorithms Sorting (Electronic computers) |
| topic_facet | Algorithms Sorting (Electronic computers) |
| volume_link | (DE-604)BV008903301 |
| work_keys_str_mv | AT langstonmichael faststablemergingandsortinginconstantextraspace |