Sorting using heap structure
In this paper we present a new sorting algorithm for heaps which can sort n (=2 h+1 - 1) elements using no more than nlog 2 (n+1) - (13/12)n - 1 element comparisons in the worst case 2 (including the heap creation phase). Experimental results show that this algorithm requires only nlog 2 (n+1) - 1.2...
Saved in:
| Published in | International journal of computer mathematics Vol. 77; no. 3; pp. 347 - 354 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Abingdon
Gordon and Breach Science Publishers
01.01.2001
Taylor and Francis |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | In this paper we present a new sorting algorithm for heaps which can sort n (=2
h+1
- 1) elements using no more than nlog
2
(n+1) - (13/12)n - 1 element comparisons in the worst case 2 (including the heap creation phase). Experimental results show that this algorithm requires only nlog
2
(n+1) - 1.2n element comparisons in the average case. However it requires extra space for 2 n LINK fields |
|---|---|
| AbstractList | In this paper we present a new sorting algorithm for heaps which can sort n (=2
h+1
- 1) elements using no more than nlog
2
(n+1) - (13/12)n - 1 element comparisons in the worst case 2 (including the heap creation phase). Experimental results show that this algorithm requires only nlog
2
(n+1) - 1.2n element comparisons in the average case. However it requires extra space for 2 n LINK fields |
| Author | Alam Chowdhury, Rezaul Kaykobad, M. |
| Author_xml | – sequence: 1 givenname: Rezaul surname: Alam Chowdhury fullname: Alam Chowdhury, Rezaul organization: Department of Computer Science and Engineering , Bangladesh University of Engineering and Technology – sequence: 2 givenname: M. surname: Kaykobad fullname: Kaykobad, M. email: kaykobad@csebuet.agni organization: Department of Computer Science and Engineering , Bangladesh University of Engineering and Technology |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14061566$$DView record in Pascal Francis |
| BookMark | eNqFkEtLxDAUhYOMYGf0BwguZuOyetOkSQNuZPAFAy7UdUjTRCOdpiQZdP69LaMuHBg398E93-FypmjS-c4gdIrhAkMFlwAFcMxgWCooh_EAZRgKkUPBygnKxns-Co7QNMZ3AKgEZxk6e_Ihue51vo5jfTOqn8cU1jqtgzlGh1a10Zx89xl6ub15Xtzny8e7h8X1MteEs5TjmmiOjQYKtRFa0NJCQUsjSEFI2SitrSl0TTkRoCxuKDG4alRFRd3UjajJDJ1vfXsVtWptUJ12UfbBrVTYSEyB4ZKxQce3Oh18jMFYqV1SyfkuBeVaiUGOYcidMAYS_yF_zfcwV1vGddaHlfrwoW1kUpvWh58XyT6c_4vvUDJ9JvIF0iuGHQ |
| CODEN | IJCMAT |
| CitedBy_id | crossref_primary_10_1016_j_neucom_2018_02_085 crossref_primary_10_1162_neco_2006_18_12_2959 crossref_primary_10_1016_j_ijpe_2018_03_007 |
| Cites_doi | 10.1016/0020-0190(87)90142-6 10.1137/0215068 10.1145/512274.512284 10.1007/BF01937350 10.1007/978-3-642-69672-5 10.1016/0304-3975(93)90364-Y 10.1145/355588.365103 10.1016/0196-6774(89)90033-3 10.1016/0890-5401(92)90005-Z 10.1016/0304-3975(95)00152-2 |
| ContentType | Journal Article |
| Copyright | Copyright Taylor & Francis Group, LLC 2001 2002 INIST-CNRS |
| Copyright_xml | – notice: Copyright Taylor & Francis Group, LLC 2001 – notice: 2002 INIST-CNRS |
| DBID | AAYXX CITATION IQODW |
| DOI | 10.1080/00207160108805071 |
| DatabaseName | CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences |
| EISSN | 1029-0265 |
| EndPage | 354 |
| ExternalDocumentID | 14061566 10_1080_00207160108805071 8805071 |
| GroupedDBID | -~X .7F .QJ 0BK 0R~ 1TA 30N 4.4 5GY 5VS AAENE AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABHAV ABJNI ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACAGQ ACGEJ ACGFS ACGOD ACIWK ACNCT ADCVX ADGTB ADXPE AEISY AENEX AEOZL AEPSL AEYOC AFKVX AGDLA AGMYJ AGROQ AHDZW AHMOU AI. AIJEM AJWEG AKBVH AKOOK ALCKM ALMA_UNASSIGNED_HOLDINGS ALQZU AMEWO AVBZW AWYRJ BLEHA CAG CCCUG CE4 COF CRFIH CS3 DGEBU DKSSO DMQIW DU5 EBS EJD ESX E~A E~B GTTXZ H13 HZ~ H~P J.P KYCEM M4Z NA5 NY~ O9- P2P PQQKQ QCRFL RNANH ROSJB RTWRZ S-T SNACF TBQAZ TDBHL TEJ TFL TFT TFW TN5 TOXWX TTHFI TUROJ TWF UPT UT5 UU3 VH1 WH7 ZGOLN ~S~ .4S .DC 07G 29J AAGDL AAHIA AAIKQ AAKBW AAYJJ AAYXX ABDBF ABEFU ACGEE ACTIO ACUHS ADYSH AEUMN AFFNX AFRVT AGCQS AGLEN AIYEW AMPGV AMVHM AMXXU AQRUH ARCSS BCCOT BPLKW C06 CITATION DWIFK EAP EDO EMK EPL EST HF~ H~9 IPNFZ IVXBP LJTGL MK~ NUSFT RIG TAQ TFMCV TUS UB9 UU8 V3K V4Q ZY4 ABTAH IQODW |
| ID | FETCH-LOGICAL-c376t-1b3c71ec040be9c945f0245e932335daccfe2cb47390af1d43e18da849bdbd9b3 |
| ISSN | 0020-7160 |
| IngestDate | Wed Apr 02 07:20:16 EDT 2025 Tue Jul 01 01:04:37 EDT 2025 Thu Apr 24 23:06:23 EDT 2025 Mon May 13 12:10:04 EDT 2019 Wed Dec 25 09:06:05 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Merge sorting Heapsorting Complexity Sorting |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c376t-1b3c71ec040be9c945f0245e932335daccfe2cb47390af1d43e18da849bdbd9b3 |
| PageCount | 8 |
| ParticipantIDs | informaworld_taylorfrancis_310_1080_00207160108805071 crossref_citationtrail_10_1080_00207160108805071 crossref_primary_10_1080_00207160108805071 pascalfrancis_primary_14061566 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 1/1/2001 2001-01-00 2001 |
| PublicationDateYYYYMMDD | 2001-01-01 |
| PublicationDate_xml | – month: 01 year: 2001 text: 1/1/2001 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Abingdon |
| PublicationPlace_xml | – name: Abingdon |
| PublicationTitle | International journal of computer mathematics |
| PublicationYear | 2001 |
| Publisher | Gordon and Breach Science Publishers Taylor and Francis |
| Publisher_xml | – name: Gordon and Breach Science Publishers – name: Taylor and Francis |
| References | Horowitz E. (CIT0007) 1995 Katajainen J. (CIT0008) 1996; 3 CIT0010 Floyd R.W. (CIT0005) 1964; 7 Williams J.W.J. (CIT0016) 1964; 7 Noltemeier H. (CIT0013) 1990; 7 Mehlhorn K. (CIT0012) 1990 CIT0003 CIT0014 Aho A.V. (CIT0001) 1974 CIT0002 Knuth D.E. (CIT0009) 1973 CIT0004 Mehlhorn K. (CIT0011) 1984 CIT0015 CIT0006 |
| References_xml | – ident: CIT0002 doi: 10.1016/0020-0190(87)90142-6 – volume-title: Fundamentals of Computer Algorithms year: 1995 ident: CIT0007 – start-page: 301 volume-title: Handbook of Theoretical Computer Science year: 1990 ident: CIT0012 – ident: CIT0006 doi: 10.1137/0215068 – volume: 7 start-page: 347 year: 1964 ident: CIT0016 publication-title: CACM doi: 10.1145/512274.512284 – ident: CIT0003 doi: 10.1007/BF01937350 – volume-title: Data Structures and Algorithms 1: Sorting and Searching year: 1984 ident: CIT0011 doi: 10.1007/978-3-642-69672-5 – volume-title: The Design and Analysis of Computer Algorithms year: 1974 ident: CIT0001 – ident: CIT0014 doi: 10.1016/0304-3975(93)90364-Y – volume: 7 start-page: 701 year: 1964 ident: CIT0005 publication-title: CACM doi: 10.1145/355588.365103 – volume: 3 start-page: 27 year: 1996 ident: CIT0008 publication-title: Nordic Journal of Computing – volume: 7 start-page: 125 year: 1990 ident: CIT0013 publication-title: Computing (Suppl.) – ident: CIT0010 doi: 10.1016/0196-6774(89)90033-3 – volume-title: Sorting and Searching year: 1973 ident: CIT0009 – ident: CIT0015 doi: 10.1016/0890-5401(92)90005-Z – ident: CIT0004 doi: 10.1016/0304-3975(95)00152-2 |
| SSID | ssj0008976 |
| Score | 1.5336297 |
| Snippet | In this paper we present a new sorting algorithm for heaps which can sort n (=2
h+1
- 1) elements using no more than nlog
2
(n+1) - (13/12)n - 1 element... |
| SourceID | pascalfrancis crossref informaworld |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 347 |
| SubjectTerms | Applied sciences Complexity Computer science; control theory; systems Data processing. List processing. Character string processing Exact sciences and technology F.2.2 Fine heap Heapsort MDR-HEAPSORT Memory organisation. Data processing Mergesort Software |
| Title | Sorting using heap structure |
| URI | https://www.tandfonline.com/doi/abs/10.1080/00207160108805071 |
| Volume | 77 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZS8NAEF60vvjiLdaLPPhkiSTZpE0eo1WCJ6il1ZeSvUDQttgI4q93NtndpFXqASU0y-ZgZzLzze7sNwgdYMpo0CTUJoxz2w-FsCPGhJ2GHieRBz5PyBXdq-tm0vHPe0FP1ypXu0syckQ_vt1X8h-pQhvIVe6S_YNkzU2hAf6DfOEIEobjr2R8N3zNs5bf8oAfzOqoUfDBKpoQjTonp_0qZBFU1XRovBj21jL3_fQx7lw24sv4qnGS3HTbSefW4N6L-OHi5jhul_OpeuagnDMoJgPy1QlVvqNqIiGehCDKqZpIVWnlqRpB5_YOF3SZynXigg_6i1XWaYyeI28Mp6EjYWjpgvSy-5RnMvmCroQdADzn0YIH4YBXQwtx0n7sGp8bRnkZQfPyev1asqhPP3YCgUzw08rE2HQM34YoRqWCNO5X0JIKEay4kPcqmuODNbSswgVLGeMxNOmKHLptHe0qjbByjbCkRlhGIzZQ5-z0_iSxVf0Lm4LZz2yXYNpyOQU7S3hEIz8QcqGcA-TGOGAppYJ7lPgtHDmpcJmPuRuyNPQjwgiLCN5EtcFwwLeQJQD3tTzS5F4qfObDF8iCFuAjya5NQkLqyNFj0qeKHF7WKHnuu4ZDdmoY6-jQXDIqmFFmdXaqA93Pcg1Uw_y1ez97z-oomHEJnvGo_Qkhli-nlGj7pw47aLHINJS_XVQDMfE9gJ4Z2Vd69wlC6H-7 |
| linkProvider | Library Specific Holdings |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTwIxEJ4oHvQiPiOKuAdPJiXstvvo0RgJKnAREm6b7YuDBogsifHX29kHAhoOJnuc7bad6czXdvYbgFsqlfQDIYlQWhMWGUO4UoYkkacF92zMM3ij2-sHnSF7Hvmj4sBtXqRV4h7a5EQRma_GxY2H0WVKHP7CbSMjbiWs9SGg2YU9nwch2jlt9ZeeOOJZcTkUJyhf3mr-1cRaXFpjLcV0yWRuZ8zkpS5W4k-7CnHZ8zzt5K25SEVTfm2QOv5_aEdwWEBT5z63pWPY0ZMTqJZlH5zCC5xC_XWK1ANjB3Pmx4715jMnp6FdfOgzGLYfBw8dUhRZINL6lpS4gsrQ1dIuZqG55Mw3eBurLa6j1FeJlEZ7UrCQ8lZiXMWodiOVRIwLJRQX9Bwqk-lEX4BjLLgIPRFoLzFMMatm5Yc2CCOFs4iEqEGrnOJYFgzkWAjjPXaXRKUbo6_B3fKVWU6_sU24taq3OM3OPAqt_RaP08-0Bv6WV-iWTzXWbOKncwiQLES-_GfDN7DfGfS6cfep_3IFB3nGGz51qFhN6msLgVLRyOz8G2AG-Tc |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEB60gnixPrFa6x48CSndTfaRo6ilvoqghd6WzasHpS12C-KvN7OP2lbpobDHSXaTmcxMNl--AbikUkk_EJIIpTVhkTGEK2VIEnlacM_GPIMnus_doNNjD32_X2BzJgWsEvfQJieKyHw1Lu6xMiUiDm9w28CIOwlrfJjPbMJWgJcs8QZHqztzxBHPasuhOEH58lDzvy4WwtICaSmiJZOJnTCTV7qYCz_tal5jdZKxFiLq5L05TUVTfi9xOq49sj3YLRJT5zq3pH3Y0MMDqJZFH5zCBxxC_XWExAMDBxHzA8f68rGTk9BOP_UR9Np3bzcdUpRYINJ6lpS4gsrQ1dIuZaG55Mw3eBarbVZHqa8SKY32pGAh5a3EuIpR7UYqiRgXSigu6DFUhqOhPgHH2NQi9ESgvcQwxaySlR_aEIwEziISogatcoZjWfCPYxmMj9id0ZQujb4GV7Mm45x8Y5Vwa15tcZr98SiU9lc8Tr_SGvgrmtAVr2osmMTvx2F6ZBPk0zU7voDtl9t2_HTffTyDnRzuhk8dKlaR-tzmP6loZFb-A0rC99s |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Sorting+using+heap+structure&rft.jtitle=International+journal+of+computer+mathematics&rft.au=REZAUL+ALAM+CHOWDHURY&rft.au=KAYKOBAD%2C+M&rft.date=2001&rft.pub=Taylor+and+Francis&rft.issn=0020-7160&rft.volume=77&rft.issue=3&rft.spage=347&rft.epage=354&rft_id=info:doi/10.1080%2F00207160108805071&rft.externalDBID=n%2Fa&rft.externalDocID=14061566 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7160&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7160&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7160&client=summon |