下面是具体的算法:
- x <- 1:100
- n <- length(x)
- probs = seq(0, 1, 0.25)
- index <- 1 + (n - 1) * probs
- lo <- floor(index)
- hi <- ceiling(index)
- x <- sort(x, partial = unique(c(lo, hi)))
- qs <- x[lo]
- i <- which(index > lo)
- h <- (index - lo)[i]
- qs[i] <- (1 - h) * qs[i] + h * x[hi[i]]
- qs
- quantile(x=1:100)
- x <- 1:100
- n <- length(x)
- n4 <- floor((n + 3)/2)/2
- d <- c(1, n4, (n + 1)/2, n + 1 - n4, n)
- 0.5 * (x[floor(d)] + x[ceiling(d)])
- fivenum(x=1:100)





雷达卡







京公网安备 11010802022788号







