Binary search algorithm {Rfast}

Binary search algorithm

Description

Search a value in an ordered vector.

Usage

binary_search(x, v, index=FALSE)

Arguments

x

A vector with the data.

v

A value to check if exists in the vector x.

index

A boolean value for choose to return the position inside the vector.

Details

The functions is written in C++ in order to be as fast as possible.

Value

Search if the v exists in x. Then returns TRUE/FALSE if the value is been found.

Author(s)

Manos Papadakis

R implementation and documentation: Manos Papadakis <[e-mail]>.

See Also

is_element

Examples

x <- sort(rnorm(1000))
v <- x[50]
b <- binary_search(x,v) 
b1 <- binary_search(x,v,TRUE)