Lines Matching refs:n2
36 /* Merge the sorted arrays src1[0..n1-1] and src2[0..n2-1] into
37 dst[0..n1+n2-1]. In case of ambiguity, put the elements of src1
39 n1 and n2 must be > 0.
41 src1 may be dst[n2..n1+n2-1], or src2 may be dst[n1..n1+n2-1]. */
44 const ELEMENT *src2, size_t n2,
47 for (;;) /* while (n1 > 0 && n2 > 0) */
59 n2--;
60 if (n2 == 0)
64 /* Here n1 == 0 || n2 == 0 but also n1 > 0 || n2 > 0. */
75 else /* n2 > 0 */
81 n2--;
83 while (n2 > 0);
169 size_t n2 = (n + 1) / 2;
170 /* Note: n1 + n2 = n, n1 <= n2. */
171 /* Sort src[n1..n-1] into dst[n1..n-1], scratching tmp[0..n2/2-1]. */
172 merge_sort_fromto (src + n1, dst + n1, n2, tmp);
176 merge (tmp, n1, dst + n1, n2, dst);
259 size_t n2 = (n + 1) / 2;
260 /* Note: n1 + n2 = n, n1 <= n2. */
261 /* Sort src[n1..n-1], scratching tmp[0..n2-1]. */
262 merge_sort_inplace (src + n1, n2, tmp);
266 merge (tmp, n1, src + n1, n2, src);