%0 Generic %1 And_ongenerating %A Tillison, Julie %A and Julie Tillison, %A kuang Shene, Ching %D ? %K 2012 insertion kde seminar sort worst %T On Generating Worst-Cases for the Insertion Sort %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.9185 %X this paper, we shall answer these questions with an algorithm that can systematically construct sequences with which the number of comparisons required by the insertion sort is between O(n) and O(n

@misc{And_ongenerating, abstract = {this paper, we shall answer these questions with an algorithm that can systematically construct sequences with which the number of comparisons required by the insertion sort is between O(n) and O(n}, added-at = {2012-06-15T16:51:09.000+0200}, author = {Tillison, Julie and and Julie Tillison and kuang Shene, Ching}, biburl = {https://www.bibsonomy.org/bibtex/297553906b5b316bd3a9ae14ce344a4cc/lenz}, description = {CiteSeerX — On Generating Worst-Cases for the Insertion Sort}, interhash = {245a5f390d02ff6e1a6c958b94431c33}, intrahash = {97553906b5b316bd3a9ae14ce344a4cc}, keywords = {2012 insertion kde seminar sort worst}, timestamp = {2012-06-15T16:51:09.000+0200}, title = {On Generating Worst-Cases for the Insertion Sort}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.9185}, year = {?} }