Given an integer $n\ge 2$, compute $\sum_{\sigma} \textrm{sgn}(\sigma) n^{\ell(\sigma)}$, where all $n$-element permutations are considered, and where $\ell(\sigma)$ is the number of disjoint cycles in the standard decomposition of $\sigma$.
1. **Define the sets and the problem:**
   Let \( A \) be the set of all bijections from \( \{1, 2, \cdots, n\} \) to \( \{1, 2, \cdots, n\} \), i.e., the set of all permutations of \( n \) elements. Let \( B \) be the set of all functions from \( \{1, 2, \cdots, n\} \) to \( \{1, 2, \cdots, n\} \). We aim to compute the sum \( \sum_{\sigma} \textrm{sgn}(\sigma) n^{\ell(\sigma)} \), where the sum is over all \( n \)-element permutations, and \( \ell(\sigma) \) is the number of disjoint cycles in the standard decomposition of \( \sigma \).

2. **Define admissible pairs:**
   We call a pair \( (f_1, f_2) \in A \times B \) \textbf{admissible} if \( f_2(x) = f_2(f_1(x)) \) for all \( x \in \{1, 2, \cdots, n\} \). This condition implies that for any cycle \( a_1, a_2, \cdots, a_k \) in the cycle decomposition of \( f_1 \), we have \( f_2(a_1) = f_2(a_2) = \cdots = f_2(a_k) \).

3. **Classify admissible pairs:**
   We classify an admissible pair \( (f_1, f_2) \) as \textbf{good} if \( \textrm{sgn}(f_1) = 1 \) and \textbf{bad} if \( \textrm{sgn}(f_1) = -1 \).

4. **Count good and bad pairs:**
   We count the number of good pairs minus the number of bad pairs in two ways. Firstly, it is immediate that this difference is the sum in the problem: \( \sum_{\sigma} \textrm{sgn}(\sigma) n^{\ell(\sigma)} \).

5. **Fix \( f_2 \) and count pairs:**
   - When \( f_2 \in A \) (i.e., \( f_2 \) is a bijection), there is only one good pair involving \( f_2 \) and no bad pairs. This pair is \( (I, f_2) \), where \( I \) is the identity permutation. This is because the condition \( f_2(x) = f_2(f_1(x)) \) implies that each cycle must have only one element, making \( f_1 \) the identity permutation.
   - When \( f_2 \notin A \) (i.e., \( f_2 \) is not a bijection), there must exist some element \( e \in \{1, 2, \cdots, n\} \) that appears at least twice in the range of \( f_2 \). For any \( k \geq 2 \), there are an equal number of even and odd permutations of \( k \) objects. Applying this to the elements mapping to \( e \) via \( f_2 \), we see that there are an equal number of bad pairs and good pairs involving \( f_2 \).

6. **Sum over all \( f_2 \):**
   By summing over all \( f_2 \)'s, we see that the total number of good pairs minus the number of bad pairs is \( n! \).

Therefore, the answer to the problem is \( n! \).

The final answer is \( \boxed{ n! } \)