A couple of other methods, which use more machinery than the earlier ones, but are worth looking into for their generality.
Bounding by integrals
Comparing the integrals by constant bounding function over unit intervals, we get
$$
\frac1{\sqrt{n}}\left(\int_1^{n+1}\frac{\mathrm{d}x}{\sqrt{x}}\right)
\le\frac1{\sqrt{n}}\sum_{k=1}^n\frac1{\sqrt{k}}
\le\frac1{\sqrt{n}}\left(1+\int_1^n\frac{\mathrm{d}x}{\sqrt{x}}\right)
$$
which yields
$$
\color{#C00000}{\frac1{\sqrt{n}}\left(2\sqrt{n+1}-2\right)}
\le\frac1{\sqrt{n}}\sum_{k=1}^n\frac1{\sqrt{k}}
\le\color{#C00000}{\frac1{\sqrt{n}}\left(2\sqrt{n}-1\right)}
$$
As $n\to\infty$, both bounding terms (in red) tend to $2$. Therefore, by the Squeeze Theorem, we get
$$
\lim_{n\to\infty}\frac1{\sqrt{n}}\sum_{k=1}^n\frac1{\sqrt{k}}=2
$$
Euler-Maclaurin Sum Formula
The Euler-Maclaurin Sum Formula says that for some constant $C$, we have
$$
\sum_{k=1}^n\frac1{\sqrt k}=2\sqrt{n}+\frac1{2\sqrt n}+C+O\left(n^{-3/2}\right)
$$
Dividing by $\sqrt n$ yields
$$
\begin{align}
\frac1{\sqrt n}\sum_{k=1}^n\frac1{\sqrt k}
&=2+\frac C{\sqrt n}+\frac1{2n}+O\left(n^{-2}\right)\\
&\to2
\end{align}
$$