I can only think of defining max (min should be able to look analoguesly) recursevely:
For a finite set of real numbers X = {a1, a2, a3, ... , an}
If |X| = 1 then max X = a1
If |X| = 2 then max X = (a1 + a2 + |a2 - a1|)/2
If |X| = n then max X = max { max( X \ {an}, an }
For a countable set I don't have an idea how I could do this since it is possible for a countable set NOT to have a max/min value (i.e. N or Z )