{"id":"https://openalex.org/W76067348","doi":null,"title":"Enhanced Quicksort Algorithm","display_name":"Enhanced Quicksort Algorithm","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W76067348","mag":"76067348"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.184.8633","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.184.8633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ccis2k.org/iajit/PDF/vol.7%2Cno.2/740.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W76067348"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5053616361","display_name":"Rami Mansi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rami Mansi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5053616361"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4013,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78680611,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"7","issue":null,"first_page":"161","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.005799999926239252,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.001500000013038516,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/quicksort","display_name":"quicksort","score":0.7760000228881836},{"id":"https://openalex.org/keywords/sorting-algorithms","display_name":"sorting algorithms","score":0.8069999814033508},{"id":"https://openalex.org/keywords/algorithm-improvement","display_name":"algorithm improvement","score":0.5130000114440918},{"id":"https://openalex.org/keywords/worst-case-performance","display_name":"worst-case performance","score":0.7179999947547913},{"id":"https://openalex.org/keywords/average-case-performance","display_name":"average-case performance","score":0.8009999990463257},{"id":"https://openalex.org/keywords/distinct-elements","display_name":"distinct elements","score":0.5529999732971191}],"concepts":[{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.9771895408630371},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.842452347278595},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.8392159938812256},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.8184798955917358},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6134188175201416},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.6060618162155151},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5820184946060181},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09244263172149658},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.06141391396522522},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.184.8633","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.184.8633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ccis2k.org/iajit/PDF/vol.7%2Cno.2/740.pdf","raw_type":"text"},{"id":"mag:76067348","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/iajit/iajit7.html#Mansi10","pdf_url":null,"source":{"id":"https://openalex.org/S100666833","display_name":"The International Arab Journal of Information Technology","issn_l":"1683-3198","issn":["1683-3198","2309-4524"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-d","jufo-1","poland-70","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4362726017","host_organization_name":"Zarqa University","host_organization_lineage":["https://openalex.org/P4362726017"],"host_organization_lineage_names":["Zarqa University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"The International Arab Journal of Information Technology","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1480188394","https://openalex.org/W1517112821","https://openalex.org/W1573761176","https://openalex.org/W1655990431","https://openalex.org/W1963643747","https://openalex.org/W1963899453","https://openalex.org/W2005063569","https://openalex.org/W2024305877","https://openalex.org/W2050001863","https://openalex.org/W2090311898","https://openalex.org/W2162674806","https://openalex.org/W2240847203","https://openalex.org/W2497602239","https://openalex.org/W3145128584","https://openalex.org/W3198160809"],"related_works":["https://openalex.org/W2775359225","https://openalex.org/W42553893","https://openalex.org/W25227476","https://openalex.org/W4320925713","https://openalex.org/W2374428410","https://openalex.org/W2994182992","https://openalex.org/W28955628","https://openalex.org/W2368813964","https://openalex.org/W2154618522","https://openalex.org/W2370955298"],"abstract_inverted_index":{"Abstract:":[0],"Sorting":[1],"is":[2,15,34,44,67,114],"considered":[3,68],"as":[4,69],"one":[5],"of":[6,10,19,29,40,89,108],"the":[7,38,73,77,95,98,117,121],"important":[8,35],"issues":[9],"computer":[11],"science.":[12],"Although":[13],"there":[14],"a":[16,26,54,90,106],"huge":[17],"number":[18],"sorting":[20,22,33,56,105],"algorithms,":[21],"problem":[23],"has":[24],"attracted":[25],"great":[27],"deal":[28],"research;":[30],"because":[31],"efficient":[32],"to":[36],"optimize":[37],"use":[39],"other":[41],"algorithms.":[42],"It":[43],"also":[45],"often":[46],"in":[47,76],"producing":[48],"human-readable":[49],"output.":[50],"This":[51],"paper":[52],"presents":[53],"new":[55],"algorithm":[57,66,75,113,119],"called":[58],"SMS-algorithm":[59],"(Scan,":[60],"Move,":[61],"and":[62,80,93,97,120],"Sort).":[63],"The":[64,111],"SMS":[65,112],"an":[70,86],"enhancement":[71],"on":[72],"Quicksort":[74,118],"best,":[78],"average,":[79],"worst":[81],"cases":[82],"when":[83,94,104],"dealing":[84],"with":[85,116],"input":[87],"array":[88],"large":[91],"size":[92],"maximum":[96],"minimum":[99],"values":[100],"were":[101,123],"small,":[102],"especially":[103],"list":[107],"distinct":[109],"elements.":[110],"compared":[115],"results":[122],"promising.":[124]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}