{"id":"https://openalex.org/W3094405874","doi":"https://doi.org/10.1109/icccnt49239.2020.9225685","title":"RBS: A New Comparative and Better Solution of Sorting Algorithm for Array","display_name":"RBS: A New Comparative and Better Solution of Sorting Algorithm for Array","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3094405874","doi":"https://doi.org/10.1109/icccnt49239.2020.9225685","mag":"3094405874"},"language":"en","primary_location":{"id":"doi:10.1109/icccnt49239.2020.9225685","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccnt49239.2020.9225685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","raw_type":"proceedings-article"},"type":"article","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/A5053122758","display_name":"Md. Hasan Imam Bijoy","orcid":"https://orcid.org/0000-0002-4756-3025"},"institutions":[{"id":"https://openalex.org/I200606013","display_name":"Daffodil International University","ror":"https://ror.org/052t4a858","country_code":"BD","type":"education","lineage":["https://openalex.org/I200606013"]}],"countries":["BD"],"is_corresponding":true,"raw_author_name":"Md. Hasan Imam Bijoy","raw_affiliation_strings":["Daffodil International University, Dhaka, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Daffodil International University, Dhaka, Bangladesh","institution_ids":["https://openalex.org/I200606013"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102903920","display_name":"Md. Rakibul Hasan","orcid":"https://orcid.org/0000-0003-2622-6764"},"institutions":[{"id":"https://openalex.org/I200606013","display_name":"Daffodil International University","ror":"https://ror.org/052t4a858","country_code":"BD","type":"education","lineage":["https://openalex.org/I200606013"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Md. Rakibul Hasan","raw_affiliation_strings":["Daffodil International University, Dhaka, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Daffodil International University, Dhaka, Bangladesh","institution_ids":["https://openalex.org/I200606013"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013323032","display_name":"Masud Rabbani","orcid":"https://orcid.org/0000-0003-3058-3625"},"institutions":[{"id":"https://openalex.org/I200606013","display_name":"Daffodil International University","ror":"https://ror.org/052t4a858","country_code":"BD","type":"education","lineage":["https://openalex.org/I200606013"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Masud Rabbani","raw_affiliation_strings":["Daffodil International University, Dhaka, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Daffodil International University, Dhaka, Bangladesh","institution_ids":["https://openalex.org/I200606013"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053122758"],"corresponding_institution_ids":["https://openalex.org/I200606013"],"apc_list":null,"apc_paid":null,"fwci":0.2651,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.639141,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"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":1.0,"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":1.0,"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/T12029","display_name":"DNA and Biological Computing","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8219716548919678},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7984484434127808},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.7676910161972046},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.696578860282898},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.666528582572937},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.47535058856010437},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4369889795780182},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43110886216163635},{"id":"https://openalex.org/keywords/big-data","display_name":"Big data","score":0.425646036863327},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4193541705608368},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3923843502998352},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.21778103709220886},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.10630044341087341}],"concepts":[{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.8219716548919678},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7984484434127808},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.7676910161972046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.696578860282898},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.666528582572937},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.47535058856010437},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4369889795780182},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43110886216163635},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.425646036863327},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4193541705608368},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3923843502998352},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.21778103709220886},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.10630044341087341},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccnt49239.2020.9225685","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccnt49239.2020.9225685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2005818856","https://openalex.org/W2090815914","https://openalex.org/W2156282657","https://openalex.org/W2157496503","https://openalex.org/W2187932560","https://openalex.org/W2439771716","https://openalex.org/W4251943397","https://openalex.org/W6651619403","https://openalex.org/W6686906393"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W2095055219","https://openalex.org/W3033694952","https://openalex.org/W2908348257","https://openalex.org/W4392178020","https://openalex.org/W2994182992","https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W2348196682","https://openalex.org/W3002909018"],"abstract_inverted_index":{"In":[0],"modern":[1],"technology":[2],"or":[3],"practical":[4],"application,":[5],"all":[6,145],"things":[7],"are":[8,89,114,151,159,165,169],"gradually":[9],"arranged.":[10],"Therefore,":[11],"in":[12,216],"this":[13],"paper,":[14],"we":[15],"attempt":[16],"to":[17,109],"establish":[18],"a":[19,40,83],"new":[20,191],"sorting":[21,30,116,120,140,192,201],"algorithm":[22,172],"and":[23,38,51,95,105,129,167,182],"compare":[24],"it":[25,106],"with":[26,78,123,174],"some":[27,52,134,158,164,168,198],"other":[28,130,199],"standard":[29],"algorithms":[31,117,193,202],"by":[32],"their":[33],"execution":[34],"times.":[35],"We":[36,187],"designed":[37],"developed":[39],"methodology":[41,71],"that":[42,141,189],"can":[43,60],"be":[44],"executed":[45],"on":[46],"random":[47],"data,":[48,50,163],"ordering":[49],"specific":[53,124],"data":[54],"(data":[55],"means":[56],"integers":[57],"value),":[58],"which":[59],"provide":[61,194],"the":[62,74,79,98,101,204,213],"best":[63],"result":[64],"for":[65,119,144,153],"Right":[66],"Bounding":[67],"Sort":[68],"(RBS).":[69],"The":[70],"is":[72,138,142],"comparing":[73],"array's":[75],"left":[76,92],"value":[77],"rightmost":[80],"value.":[81],"Under":[82],"particular":[84],"condition,":[85],"these":[86],"two":[87],"values":[88],"swapped,":[90],"then":[91],"index":[93,103],"increase,":[94],"after":[96],"completing":[97],"first":[99],"step,":[100],"right":[102],"decrease,":[104],"continues":[107],"up":[108],"array":[110,122],"size.":[111],"Though":[112],"there":[113,137],"many":[115],"invented":[118],"an":[121],"time":[125,180,219],"complexity,":[126,128],"space":[127,185],"factors,":[131],"they":[132],"have":[133],"limitations":[135],"because":[136],"no":[139],"perfect":[143],"various":[146],"types":[147],"of":[148,156,162,218],"data.":[149],"Some":[150],"good":[152],"small":[154],"ranges":[155,161],"value,":[157],"vast":[160],"stable,":[166],"unstable.":[170],"This":[171],"performs":[173],"Big-O(n":[175],"<sup":[176],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[177],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[178],")":[179],"complexity":[181],"Big-O":[183],"(1)":[184],"complexity.":[186,220],"see":[188],"our":[190],"better":[195],"solutions":[196],"than":[197],"existing":[200],"like":[203],"bubble":[205],"sort,":[206,208,210],"insertion":[207],"cycle":[209],"etc.":[211],"On":[212],"experimental":[214],"dataset":[215],"respect":[217]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}