Searched refs:log2n (Results 1 – 2 of 2) sorted by relevance
50 qsort_bench(int log2n) in qsort_bench() argument52 uintmax_t n = 1LLU << log2n; in qsort_bench()81 ATF_CHECK_MSG(ncmp / n <= log2n + 1, in qsort_bench()
25799 … connected components of an undirected graph with $n$ vertices in time $O(log2n)$. An $O(\log_2n)$…