It seems to be folklore that "ETCS suffices to develop most of algebraic geometry", formally backed by the fact that "ETCS is equivalent to Bounded ZFC". But I have some doubts about that former fact:
If I am not mistaken the axioms of ETCS amount to requiring a wellpointed topos $\mathsf{Set}$ with natural numbers object and choice. As such there is nothing telling us that this topos is complete or cocomplete. In fact, if it were assumed to be cocomplete the object $$\coprod\limits_{n\geq0}\mathcal{P}^{(n)}(\mathbb{N})$$ should exist. But it is remarked here that it is consistent with ETCS that this object does not exist (at least this is my takeaway).
Now consider the construction of an algebraic closure $\overline{K}$ of a field $K$. One standard way is to iteratively construct algebraic field extensions $L^{(n)} \mid L^{(n)}$, such that $L^{(0)}=K$ and in $L^{(n+1)}$ every polynomial with coefficients in $L^{(n)}$ splits. The union $$L = \bigcup\limits_{n\geq0} L^{(n)}$$ turns out to be an algebraic closure of $K$. But this unit is an infinitely large filtered colimit, so a priori there is no reason for this to exist in our topos $\mathsf{Set}$. Other variants of this construction (as explained here) also inherently use transfinite colimits.
Up until now I was under the impression that reduction to the algebraically closed case was one of the more important tools of algebraic geometry. So with the slogan from the beginning of this question in mind this rises the question:
Can the algebraic closure of a field be constructed in ETCS without further assumptions on the topos $\mathsf{Set}$?
Thank you for your time.
Any elementary topos is complete and cocomplete in an internal sense. If you have an NNO then you will have certain inductive constructions, though not all. As you say, the iterated powerset is not available, because it cannot be bounded a priori. On the other hand, the algebraic closure can be bounded a priori – in fact, it can be constructed in non-iteratively:
That said, there are hidden uses of induction (even transfinite induction) in the above. For example, in step 2, we use induction to construct $I$ as a subset of $A$, and in step 3, we use transfinite induction to construct $\mathfrak{m}$ as a subset of $A$. These are legitimate essentially because the objective is a subset of a set we already have.