{"id":"https://openalex.org/W2153805873","doi":"https://doi.org/10.15623/ijret.2014.0311043","title":"A UNIQUE SORTING ALGORITHM WITH LINEAR TIME & SPACE COMPLEXITY","display_name":"A UNIQUE SORTING ALGORITHM WITH LINEAR TIME & SPACE COMPLEXITY","publication_year":2014,"publication_date":"2014-11-25","ids":{"openalex":"https://openalex.org/W2153805873","doi":"https://doi.org/10.15623/ijret.2014.0311043","mag":"2153805873"},"language":"en","primary_location":{"id":"doi:10.15623/ijret.2014.0311043","doi":"https://doi.org/10.15623/ijret.2014.0311043","is_oa":false,"landing_page_url":"https://doi.org/10.15623/ijret.2014.0311043","pdf_url":null,"source":{"id":"https://openalex.org/S4210210127","display_name":"International Journal of Research in Engineering and Technology","issn_l":"2319-1163","issn":["2319-1163","2321-7308"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Research in Engineering and Technology","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5016007447","display_name":"Sanjib Palui .","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sanjib Palui .","raw_affiliation_strings":["PLP, CVPR Unit, Indian Statistical Institute, WB, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PLP, CVPR Unit, Indian Statistical Institute, WB, India","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016007447"],"corresponding_institution_ids":["https://openalex.org/I6498739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"03","issue":"11","first_page":"264","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9218999743461609,"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.9218999743461609,"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.05009999871253967,"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.0035000001080334187,"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/sorting-algorithms","display_name":"sorting algorithms","score":0.7459999918937683},{"id":"https://openalex.org/keywords/linear-time-complexity","display_name":"linear time complexity","score":0.9879999756813049},{"id":"https://openalex.org/keywords/linear-space-complexity","display_name":"linear space complexity","score":0.9959999918937683},{"id":"https://openalex.org/keywords/divide-and-conquer","display_name":"divide-and-conquer","score":0.9929999709129333},{"id":"https://openalex.org/keywords/asymptotic-efficiency","display_name":"asymptotic efficiency","score":0.8539999723434448},{"id":"https://openalex.org/keywords/list-sorting","display_name":"list sorting","score":0.6150000095367432}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7966122627258301},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.595417857170105},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5802995562553406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4948400855064392},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4650171101093292},{"id":"https://openalex.org/C130187892","wikidata":"https://www.wikidata.org/wiki/Q133327","display_name":"Spacetime","level":2,"score":0.4611772298812866},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.43800002336502075},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.16550126671791077},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.15623/ijret.2014.0311043","doi":"https://doi.org/10.15623/ijret.2014.0311043","is_oa":false,"landing_page_url":"https://doi.org/10.15623/ijret.2014.0311043","pdf_url":null,"source":{"id":"https://openalex.org/S4210210127","display_name":"International Journal of Research in Engineering and Technology","issn_l":"2319-1163","issn":["2319-1163","2321-7308"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Research in Engineering and Technology","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1521636736","https://openalex.org/W1600795850","https://openalex.org/W1655990431","https://openalex.org/W1981663184","https://openalex.org/W1989640573","https://openalex.org/W1993449345","https://openalex.org/W1996444638","https://openalex.org/W2000484009","https://openalex.org/W2027655284","https://openalex.org/W2038142281","https://openalex.org/W2054267906","https://openalex.org/W2061246500","https://openalex.org/W2066823629","https://openalex.org/W2069852500","https://openalex.org/W2090395652","https://openalex.org/W2110836275","https://openalex.org/W2116444705","https://openalex.org/W2125495920","https://openalex.org/W2153708093","https://openalex.org/W2154606454","https://openalex.org/W2164215197","https://openalex.org/W2184746130","https://openalex.org/W2330205009","https://openalex.org/W2776089907","https://openalex.org/W3145128584","https://openalex.org/W3158124029","https://openalex.org/W3198160809","https://openalex.org/W4238798236","https://openalex.org/W4243460019","https://openalex.org/W4249958171","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W7099890537","https://openalex.org/W1621522736","https://openalex.org/W2742027997","https://openalex.org/W4317899163","https://openalex.org/W3210589070","https://openalex.org/W4293059767","https://openalex.org/W2273363995","https://openalex.org/W2006670935","https://openalex.org/W2326854632","https://openalex.org/W2896131623"],"abstract_inverted_index":{"Sorting":[0],"a":[1,41,50,58,109,113,141,172,187,199,214],"list":[2,14,28,51,56,200],"means":[3],"selection":[4],"of":[5,9,12,31,62,98,116,123,130,221,243,263],"the":[6,10,17,71,86,121,193,235,241,244,256],"particular":[7],"permutation":[8,19],"members":[11,21],"that":[13,154],"in":[15,22,25,57,70,178,181],"which":[16],"final":[18],"contains":[20],"increasing":[23],"or":[24,44],"decreasing":[26],"order.Sorted":[27],"is":[29,64,158,176,186,196,237,250,266],"prerequisite":[30],"some":[32],"optimized":[33,238],"operations":[34],"such":[35],"as":[36],"searching":[37],"an":[38,46,156,191],"element":[39,47],"from":[40,49],"list,":[42],"locating":[43],"removing":[45],"to/":[48],"and":[52,75,88,100,127,133,152,169,204,209,232,247,273],"merging":[53],"two":[54],"sorted":[55],"database":[59],"etc.As":[60],"volume":[61],"information":[63],"growing":[65],"up":[66],"day":[67,69],"by":[68,212],"world":[72],"around":[73],"us":[74],"these":[76,225],"data":[77],"are":[78,93,95,228],"unavoidable":[79],"to":[80,120,139,161,166,197,255,259,271],"manage":[81],"for":[82,190,234],"real":[83],"life":[84],"situations,":[85],"efficient":[87],"cost":[89],"effective":[90],"sorting":[91,103,108],"algorithms":[92,104],"required.There":[94],"several":[96],"numbers":[97],"fundamental":[99],"problem":[101,110,215,257],"oriented":[102],"but":[105],"still":[106],"now":[107],"has":[111],"attracted":[112],"great":[114],"deal":[115],"research,":[117],"perhaps":[118],"due":[119],"complexity":[122,168,185,206],"solving":[124],"it":[125],"efficiently":[126],"effectively":[128],"despite":[129],"its":[131],"simple":[132],"familiar":[134],"statements.Algorithms":[135],"having":[136],"same":[137,142],"efficiency":[138,262],"do":[140],"work":[143],"using":[144,207],"different":[145],"mechanisms":[146],"must":[147],"differ":[148],"their":[149],"required":[150],"time":[151,170,184,203,231,272],"space.For":[153],"reason":[155],"algorithm":[157,236,265],"chosen":[159],"according":[160],"one's":[162],"need":[163],"with":[164,201,269],"respect":[165,270],"space":[167,174,205,233],"complexity.Now":[171],"day,":[173],"(Memory)":[175],"available":[177],"market":[179],"comparatively":[180],"cheap":[182],"cost.So,":[183],"major":[188],"issue":[189],"algorithm.Here,":[192],"presented":[194],"approach":[195],"sort":[198],"linear":[202],"divide":[208],"conquer":[210],"rule":[211],"partitioning":[213],"into":[216],"n":[217],"(input":[218],"size)":[219,258],"number":[220],"sub":[222,226],"problems":[223,227],"then":[224],"solved":[229],"recursively.Required":[230],"through":[239],"reducing":[240],"height":[242,249],"recursive":[245],"tree":[246],"reduced":[248],"too":[251],"small":[252],"(as":[253],"compared":[254],"evaluate.So,":[260],"asymptotic":[261],"this":[264],"very":[267],"high":[268],"space.":[274]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}