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

How to Cite

Gerdjikov, S. (2013). ASYMPTOTICALLY FASTEST SORTING ALGORITHM FOR ALMOST SORTED ARRAYS. Ann. Sofia Univ. Fac. Math. And Inf., 101, 43–50. Retrieved from https://stipendii.uni-sofia.bg/index.php/fmi/article/view/228

Issue

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

Section

Articles