This is an interesting case showing why mathematicians should understand non-standard math like constructive math, even when we don't "believe it." It still helps us understand things about standard math.
There's a very deep reason why all the basic discontinuous functions are defined piecewise, or as limits.
It is known that in constructive mathematics, all functions are continuous.
But wait, you ask, what about simple piece-wise function such as:
$$f(x)=\begin{cases}0&x<0\\
1&x\geq 0\end{cases}?$$
I mean, that looks constructive, but it is discontinuous.
It turns out $f$ is not constructive. That's because the test of whether $x<0$ is not computable. There is no computer program which takes a (computable) real number and returns whether that number is negative.
A computable real number is, roughly, a computer program which produces a Cauchy sequence of rational numbers (and the ability to have some idea how fast it converges.)
If $x=(x_n)$ and $y=(y_n)$ are computable real numbers, we define $x<y$ for such real numbers easily enough: $x<y$ if there exists a proof that $x_n<y_n$ for all but possibly finitely many $n.$
We define $x=y$ if we can prove that $x_n-y_n\to 0.$
Under this definition, there are real numbers that are not comparable. We simply can't tell if $x<y, x=y,$ or $x>y$ for some values $x,y.$
Why?
If there was a program that solved the general order problem for computable real numbers, you could solve the halting problem (by taking a program $P$ and producing the computable sequence
$$x_n=\begin{cases}0&\text{if $P$ does not halt by step $n$}\\
\frac{1}{N}&\text{if $P$ stops at step $N$ and $n\geq N$}
\end{cases}$$
This is computably Cauchy - that is, given a rational $\epsilon>0$ we can compute an $M$ such that $|x_n-x_m|<\epsilon$ for $n,m\geq M.$)
(That is why we choose $\frac{1}{N}$ and not a constant.) The sequence converges to $0$ if the program doesn't halt, or $\frac{1}{N}.$
So if we could solve the whether $x=0$ or $x>0,$ we'd have a solution to the halting poblem.
This is why all the cases of discontinuous functions rely in either cases, or other non-constructive techniques, like point-wise limits of functions.
Note that some piecewise functions can be computed, but only if they are continuous. For example, if $x=(x_n)$ then $|x|=(|x_n|).$ That might seem circular, but the $|x_n|$ is the rational absolute value function, which is computable. Rational piecewise functions are computable (if the pieces are computable in the rationals.)