@article{BCM06, author = {{Michael A. Bender, Martin Farach-Colton}, Miguel A. Mosteiro}, editor = {Springer Science+Business Media, Inc.}, interhash = {65f2663837a14db219d7342da39408f7}, intrahash = {5c381a08b28f34b54770e81951967e20}, journal = {Theory of Computing Systems}, title = {INSERTION SORT Is O(nlogn)}, year = 2006 } @article{JLB84, author = {Bentley, John L.}, editor = {of the ACM, Coninrunicatiorrs}, interhash = {a477abaccb67e6507ca961b5e65ecd9a}, intrahash = {d4706d21afbb4e5cef97cc3817471655}, journal = {Coninrunicatiorrs of the ACM }, title = {Programming Pearls, How to Sort}, year = 1984 } @article{Bron74, author = {Bron, Coenraad}, ee = {http://doi.acm.org/10.1145/361604.361631}, interhash = {712b38217a78adb45a2797fb12a6c552}, intrahash = {25501f34498a5562c8c50ed70bea2199}, journal = {Commun. ACM}, number = 12, pages = 706, title = {Merge Sort Algorithm (Remark on Algorithm 426).}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Bron74}, volume = 17, year = 1974 } @article{Cole88, author = {Cole, Richard}, ee = {http://dx.doi.org/10.1137/0217049}, interhash = {4175ed4207e0420d74d5cd44571241d0}, intrahash = {9e182c57e1bfac2f2aa888111300c982}, journal = {SIAM J. Comput.}, number = 4, pages = {770-785}, title = {Parallel Merge Sort.}, url = {http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp17.html#Cole88}, volume = 17, year = 1988 } @article{ChlebusV91, author = {Chlebus, Bogdan S. and Vrto, Imrich}, ee = {http://dx.doi.org/10.1016/0743-7315(91)90040-G}, interhash = {c7968394083da3d42639a280317e365f}, intrahash = {b144e04820bca889124e7791d330aff6}, journal = {J. Parallel Distrib. Comput.}, number = 4, pages = {332-337}, title = {Parallel Quicksort.}, url = {http://dblp.uni-trier.de/db/journals/jpdc/jpdc11.html#ChlebusV91}, volume = 11, year = 1991 } @article{LinLT12, author = {Lin, Chun-Yuan and Lee, Wei Sheng and Tang, Chuan Yi}, ee = {http://dx.doi.org/10.4018/jghpc.2012040101}, interhash = {f997386bf7a538a5325828cbdb3c5074}, intrahash = {819d2f02cc699fd0f3ccfb172e60dce9}, journal = {IJGHPC}, number = 2, pages = {1-16}, title = {Parallel Shellsort Algorithm for Many-Core GPUs with CUDA.}, url = {http://dblp.uni-trier.de/db/journals/ijghpc/ijghpc4.html#LinLT12}, volume = 4, year = 2012 } @article{MartinezR01, author = {Martínez, Conrado and Roura, Salvador}, ee = {http://dx.doi.org/10.1137/S0097539700382108}, interhash = {156e27cf4b94f720addafeef69fbfef6}, intrahash = {0e9c2082f1b09156e42de7226786e1ba}, journal = {SIAM J. Comput.}, number = 3, pages = {683-705}, title = {Optimal Sampling Strategies in Quicksort and Quickselect.}, url = {http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#MartinezR01}, volume = 31, year = 2001 } @article{2798180720070501, abstract = {Many algorithms are available for sorting the unordered elements. Most important of them are Bubble sort, Heap sort, Insertion sort and Shell sort. These algorithms have their own pros and cons. Shell Sort which is an enhanced version of insertion sort, reduces the number of swaps of the elements being sorted to minimize the complexity and time as compared to insertion sort. Shell sort improves the efficiency of insertion sort by quickly shifting values to their destination. Average sort time is O(n1.25), while worst-case time is O(n1.5). It performs certain iterations. In each iteration it swaps some elements of the array in such a way that in last iteration when the value of h is one, the number of swaps will be reduced. Donald L. Shell invented a formula to calculate the value of 'h'. this work focuses to identify some improvement in the conventional Shell sort algorithm. "Enhanced Shell Sort algorithm" is an improvement in the algorithm to calculate the value}, author = {Shahzad, Basit and Afzal, Muhammad Tanvir}, interhash = {0c52ec6c34dd1cff11e4e0358fc45626}, intrahash = {7825106029dc781e39c89517a06cef95}, issn = {13055313}, journal = {Enformatika}, pages = {66 - 70}, title = {Enhanced Shell Sorting Algorithm.}, url = {http://search.ebscohost.com/login.aspx?direct=true&db=iih&AN=27981807&site=ehost-live}, volume = 21, year = 2007 } @inproceedings{Sedgewick96, author = {Sedgewick, Robert}, booktitle = {ESA}, editor = {Díaz, Josep and Serna, Maria J.}, ee = {http://dx.doi.org/10.1007/3-540-61680-2_42}, interhash = {0594c31c1838ff65f77a0dca32ca92b6}, intrahash = {a0f574d6dfc03e06162c839c8d46eb9f}, isbn = {3-540-61680-2}, pages = {1-11}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Analysis of Shellsort and Related Algorithms.}, url = {http://dblp.uni-trier.de/db/conf/esa/esa96.html#Sedgewick96}, volume = 1136, year = 1996 } @article{NardelliP06, author = {Nardelli, Enrico and Proietti, Guido}, ee = {http://dx.doi.org/10.1016/j.ins.2005.04.008}, interhash = {356336e0568bc17de745ef722615fd8d}, intrahash = {c6705389899c14860cdfca5fc1822a83}, journal = {Inf. Sci.}, number = 10, pages = {1321-1337}, title = {Efficient unbalanced merge-sort.}, url = {http://dblp.uni-trier.de/db/journals/isci/isci176.html#NardelliP06}, volume = 176, year = 2006 } @inproceedings{Edmondson05, author = {Edmondson, James R.}, booktitle = {AMCS}, editor = {Arabnia, Hamid R. and Ajwa, Iyad A.}, interhash = {ac3774a5c93e8388408c02b88cd87f3b}, intrahash = {6b23433b75923b34b951cfbd3c503283}, isbn = {1-932415-63-7}, pages = {47-53}, publisher = {CSREA Press}, title = {M Pivot Sort - Replacing Quick Sort.}, url = {http://dblp.uni-trier.de/db/conf/amcs/amcs2005.html#Edmondson05}, year = 2005 } @article{astrachan2003bubble, author = {Astrachan, O.}, interhash = {a7b4dd529c860c4c616849b8438862f8}, intrahash = {5fcb1d8f6fb02d8894bffd1f8d348c75}, journal = {SIGCSE BULLETIN}, month = {1}, number = {PART 1}, title = {Bubble Sort: An Archaeological Algorithmic Analysis}, uniqueid = {RN128498059|edsbl}, volume = 35, year = 2003 } @article{Hoare1961, author = {Hoare, C. A. R.}, ee = {http://doi.acm.org/10.1145/366622.366644}, interhash = {bd42d51836f956e2deebeb10b8e5f93a}, intrahash = {1b58ff39c1c545c2be8114935d3c757d}, journal = {Commun. ACM}, number = 7, pages = 321, title = {Algorithm 64: Quicksort.}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, volume = 4, year = 1961 } @article{356594, abstract = {The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples. As the algorithms are explained, references to related algorithms and mathematical or experimental analyses are given. Suggestions are then made for choosing the algorithm best suited to a given situation.}, address = {New York, NY, USA}, author = {Martin, W. A.}, doi = {10.1145/356593.356594}, interhash = {1bed8163f826eb4d7631c9135f9aaf8a}, intrahash = {935269dff6cce683c61c9086662e136d}, issn = {0360-0300}, journal = {ACM Comput. Surv.}, number = 4, pages = {147--174}, publisher = {ACM}, title = {Sorting}, url = {http://portal.acm.org/citation.cfm?id=356593.356594&coll=Portal&dl=GUIDE&CFID=89172762&CFTOKEN=95662085}, volume = 3, year = 1971 } @article{Bron1972, author = {Bron, Coenraad}, ee = {http://doi.acm.org/10.1145/355602.361317}, interhash = {4ae679847cd91d3d6dfddd8f153327d4}, intrahash = {b68c8da501db7bd83e97dc72ba5fe1fd}, journal = {Commun. ACM}, number = 5, pages = {357-358}, title = {Merge Sort Algorithm [M1] (Algorithm 426).}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Bron72}, volume = 15, year = 1972 } @article{journals/cacm/HuangL88, author = {Huang, Bing-Chao and Langston, Michael A.}, ee = {http://doi.acm.org/10.1145/42392.42403}, interhash = {2bdf98adccbb7602aef696ae5100d419}, intrahash = {236f37c41dd207a10213d7833c24f4b1}, journal = {Commun. ACM}, number = 3, pages = {348-352}, title = {Practical In-Place Merging.}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm31.html#HuangL88}, volume = 31, year = 1988 } @article{li2012experiment, author = {Li, Lin and Rui, SuJuan}, editor = {Zhu, Rongbo and Ma, Yan}, interhash = {47c21977245ed6c26b3074f9e2701be3}, intrahash = {f5d45825de52330a88fae4ad582d729e}, title = {Experiment Analysis on the Bubble Sort Algorithm and Its Improved Algorithms}, year = 2012 } @mastersthesis{seward1954information, author = {Seward, Harold H.}, interhash = {dc55dfc2ceec31b94a8d249da464bd67}, intrahash = {f9f2007fa7bd0ca52c96dfc4ab7336e7}, school = {Massachusetts Institute of Technology}, title = {Information sorting in the application of electronic digital computers to business operations}, type = {master's thesis}, year = 1954 }