article · Theoretical Computer Science · 2025

Shell sort with expected complexity of O(nlog2n)

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Hu, S. (2025). Shell sort with expected complexity of O(nlog2n). Theoretical Computer Science, 1034, 115122. https://doi.org/10.1016/j.tcs.2025.115122

MLA 9

Hu, Shengrong. “Shell sort with expected complexity of O(nlog2n).” Theoretical Computer Science, vol. 1034, 2025, p. 115122, https://doi.org/10.1016/j.tcs.2025.115122.

Chicago

Hu, Shengrong. 2025. “Shell sort with expected complexity of O(nlog2n).” Theoretical Computer Science 1034: 115122. https://doi.org/10.1016/j.tcs.2025.115122.

Harvard

Hu, S. (2025) ‘Shell sort with expected complexity of O(nlog2n)’, Theoretical Computer Science, 1034, p. 115122. Available at: https://doi.org/10.1016/j.tcs.2025.115122.

BibTeX

@article{hu2025shell,
  title = {{Shell sort with expected complexity of O(nlog2n)}},
  author = {Hu, Shengrong},
  journal = {Theoretical Computer Science},
  volume = {1034},
  pages = {115122},
  year = {2025},
  doi = {10.1016/j.tcs.2025.115122}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.