get_complexity_extreme: get complexity extreme

In binsegRcpp: Efficient Implementation of Binary Segmentation

get complexity extreme

Description

Compute best and worst case number of splits.

Usage

get_complexity_extreme(N.data, 
    min.segment.length = 1L, 
    n.segments = NULL)

Arguments

N.data	number of data to segment, positive integer.
min.segment.length	minimum segment length, positive integer.
n.segments	number of segments, positive integer.

Value

data.table with one row per model size, and column splits with number of splits to check after computing that model size. Column case has values best (equal segment sizes, min splits to check) and worst (unequal segment sizes, max splits to check).

Author(s)

Toby Dylan Hocking

binsegRcpp documentation built on Sept. 8, 2023, 6:11 p.m.