ASYMPTOTICALLY FASTEST SORTING ALGORITHM FOR ALMOST SORTED ARRAYS

Authors

  • Stefan Gerdjikov

Keywords:

increasing subsequences, Patience sorting algorithm, worst-case optimality

Downloads

Published

2013-12-12

Issue

Vol. 101 (2013): Ann. Sofia Univ. Fac. Math and Inf.

Section

Articles

How to Cite

ASYMPTOTICALLY FASTEST SORTING ALGORITHM FOR ALMOST SORTED ARRAYS. (2013). Annual of Sofia University St. Kliment Ohridski. Faculty of Mathematics and Informatics, 101, 43-50. https://annual.uni-sofia.bg/index.php/fmi/article/view/228