other · Figshare · 2016

Algorithm of binary search :Rcpp code

M. E., Macherki

Cited by 0Open access

Abstract

A binary search divides a range of values(sorted array) into halves by the median point(noted k), and continues tonarrow down the field of search until the pattern(noted x) is found. It is the classic example of a "divide and conquer" algorithm.

Cite this paper

APA 7

M. E., M. (2016). Algorithm of binary search :Rcpp code. Figshare. https://doi.org/10.6084/m9.figshare.3394741

MLA 9

M. E., Macherki. “Algorithm of binary search :Rcpp code.” Figshare, 2016, https://doi.org/10.6084/m9.figshare.3394741.

Chicago

M. E., Macherki. 2016. “Algorithm of binary search :Rcpp code.” Figshare. https://doi.org/10.6084/m9.figshare.3394741.

Harvard

M. E., M. (2016) ‘Algorithm of binary search :Rcpp code’, Figshare. Available at: https://doi.org/10.6084/m9.figshare.3394741.

BibTeX

@misc{me2016algorithm,
  title = {{Algorithm of binary search :Rcpp code}},
  author = {M. E., Macherki},
  journal = {Figshare},
  year = {2016},
  doi = {10.6084/m9.figshare.3394741}
}

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