{"id":"https://openalex.org/W2997393250","doi":"https://doi.org/10.1109/icccnt45670.2019.8944607","title":"A variant of Bucket Sort Shell Sort vs Insertion Sort","display_name":"A variant of Bucket Sort Shell Sort vs Insertion Sort","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2997393250","doi":"https://doi.org/10.1109/icccnt45670.2019.8944607","mag":"2997393250"},"language":"en","primary_location":{"id":"doi:10.1109/icccnt45670.2019.8944607","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccnt45670.2019.8944607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 10th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036323631","display_name":"Abhay Goel","orcid":null},"institutions":[{"id":"https://openalex.org/I2799452066","display_name":"Maharaja Engineering College","ror":"https://ror.org/034pbde03","country_code":"IN","type":"education","lineage":["https://openalex.org/I2799452066","https://openalex.org/I33585257"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Goel Abhay","raw_affiliation_strings":["Dept. of Computer Science Engineering, Maharaja Agrasen Institute of Technology, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science Engineering, Maharaja Agrasen Institute of Technology, Delhi, India","institution_ids":["https://openalex.org/I2799452066"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100575089","display_name":"Sharma Abhishek","orcid":"https://orcid.org/0000-0002-3599-8486"},"institutions":[{"id":"https://openalex.org/I2799452066","display_name":"Maharaja Engineering College","ror":"https://ror.org/034pbde03","country_code":"IN","type":"education","lineage":["https://openalex.org/I2799452066","https://openalex.org/I33585257"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sharma Abhishek","raw_affiliation_strings":["Dept. of Computer Science Engineering, Maharaja Agrasen Institute of Technology, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science Engineering, Maharaja Agrasen Institute of Technology, Delhi, India","institution_ids":["https://openalex.org/I2799452066"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101622183","display_name":"Namita Gupta","orcid":"https://orcid.org/0000-0001-6084-0755"},"institutions":[{"id":"https://openalex.org/I2799452066","display_name":"Maharaja Engineering College","ror":"https://ror.org/034pbde03","country_code":"IN","type":"education","lineage":["https://openalex.org/I2799452066","https://openalex.org/I33585257"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Gupta Namita","raw_affiliation_strings":["(HOD) Computer Science Engineering, Maharaja Agrasen Institute of Technology, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"(HOD) Computer Science Engineering, Maharaja Agrasen Institute of Technology, Delhi, India","institution_ids":["https://openalex.org/I2799452066"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2799452066"],"apc_list":null,"apc_paid":null,"fwci":0.1093,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.4408819,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9758999943733215,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9627000093460083,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.7915911674499512},{"id":"https://openalex.org/keywords/merge-sort","display_name":"Merge sort","score":0.7841851115226746},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.7734649181365967},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7017855048179626},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.535322368144989},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5037690997123718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44730114936828613},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.06536397337913513}],"concepts":[{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7915911674499512},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.7841851115226746},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.7734649181365967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7017855048179626},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.535322368144989},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5037690997123718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44730114936828613},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.06536397337913513}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccnt45670.2019.8944607","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccnt45670.2019.8944607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 10th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2511099490","https://openalex.org/W2800072912","https://openalex.org/W2912068108"],"related_works":["https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W1480783219","https://openalex.org/W2295640672","https://openalex.org/W2175116031","https://openalex.org/W2348196682","https://openalex.org/W2977813765","https://openalex.org/W2118558147","https://openalex.org/W3038595913","https://openalex.org/W2267918355"],"abstract_inverted_index":{"Sorting":[0,25],"is":[1,89],"a":[2,6,13,21,87,102],"technique":[3],"to":[4,12,65,82,112],"rearrange":[5],"given":[7],"list":[8],"of":[9,24,39,54,58,73,107,110],"elements":[10],"according":[11],"comparison":[14],"operator":[15],"on":[16,44],"the":[17,40,56,68,70,76,80,108],"elements.":[18],"There":[19],"are":[20],"large":[22],"number":[23,53,72],"Algorithms":[26],"like":[27],"Insertion":[28],"Sort,":[29,31,33,35],"Merge":[30],"Bucket":[32],"Shell":[34,99],"etc.":[36],"The":[37],"efficiency":[38],"sorting":[41,94],"algorithm":[42],"depends":[43],"many":[45],"factors":[46],"such":[47],"as":[48],"memory":[49,59],"usage":[50],"patterns":[51],"(the":[52],"times":[55],"sections":[57],"must":[60],"be":[61],"copied":[62],"or":[63],"swapped":[64],"and":[66,75,98],"from":[67],"disk),":[69],"total":[71],"comparisons":[74],"time":[77],"requirements":[78],"for":[79],"algorithms":[81,95],"run.":[83],"In":[84],"this":[85],"paper,":[86],"method":[88],"proposed":[90],"which":[91],"combines":[92],"two":[93],"(Bucket":[96],"Sort":[97],"Sort)":[100],"in":[101],"way":[103],"that":[104],"takes":[105],"advantage":[106],"strength":[109],"each":[111],"improve":[113],"overall":[114],"performance.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}