In this paper, we examine the pseudorandomness of a family of sequences with respect to two key measures: family complexity ( $f$-complexity) and cross-correlation measure of order $\ell$. Our study encompasses sequences over both binary and $k$-symbol ( $k$-ary) alphabets. We first extend known methods for constructing families of binary pseudorandom sequences and establish a bound on the $f$-complexity of a large family of binary sequences generated from the Legendre symbols of certain irreducible polynomials. We demonstrate that this family, as well as its dual, exhibits both high family complexity and low cross-correlation measure up to a relatively high order. Additionally, we present a second family of binary sequences with similarly high $f$-complexity and low cross-correlation measure. Finally, we generalize our results to families of sequences over the $k$-symbol alphabets.