Consider the sum $$S(n,c) = \sum_{i=1}^{n-1}\dfrac{i}{ci+(n-i)}$$ where $0\le c\le 1$.
When $c=0$, $S(n,c)$ grows asymptotically as $n\log n$.
When $c=1$, $S(n,c)$ grows asymptotically as $n$.
What about when $0<c<1$? Can we calculate $S(n,c)$ exactly? What about asymptotics? Can we find upper/lower bounds?
We have $$S(n;c) = \sum_{k=1}^{n-1} \dfrac{k}{ck+(n-k)} = \sum_{k=1}^{n-1} \dfrac{k/n}{1+(c-1)k/n}$$ Hence, $$\dfrac{S(n;c)}n = \sum_{k=1}^{n-1} \dfrac{k/n}{1+(c-1)k/n} \dfrac1n \sim \int_0^1 \dfrac{xdx}{1+(c-1)x} = \dfrac{(c-1)-\log(c)}{(c-1)^2} \text{ for }c \in (0,1)$$ Hence, $$S(n;c) \sim \dfrac{(c-1)-\log(c)}{(c-1)^2} n \text{ for }c \in (0,1)$$ Better approximations can be obtained using Euler Maclaurin formula.