other · Figshare · 2016

Shell Sort Algorithm:Rcpp

M. E., Macherki

Cited by 0Open access

Abstract

This code resumes the most famous sorting algorithm: the shell Sort. This method starts by sorting pairs of elements far apart from each other, then progressively reducing the gap between elements to be compared.The running time of Shell sort is heavily dependent on the gap sequence it uses.

Cite this paper

APA 7

M. E., M. (2016). Shell Sort Algorithm:Rcpp. Figshare. https://doi.org/10.6084/m9.figshare.3386284

MLA 9

M. E., Macherki. “Shell Sort Algorithm:Rcpp.” Figshare, 2016, https://doi.org/10.6084/m9.figshare.3386284.

Chicago

M. E., Macherki. 2016. “Shell Sort Algorithm:Rcpp.” Figshare. https://doi.org/10.6084/m9.figshare.3386284.

Harvard

M. E., M. (2016) ‘Shell Sort Algorithm:Rcpp’, Figshare. Available at: https://doi.org/10.6084/m9.figshare.3386284.

BibTeX

@misc{me2016shell,
  title = {{Shell Sort Algorithm:Rcpp}},
  author = {M. E., Macherki},
  journal = {Figshare},
  year = {2016},
  doi = {10.6084/m9.figshare.3386284}
}

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