Re: On the complexity of determining whether n numbers are distinct

Let's take the standard RAM computation model with addition and
logarithmic cost measure. (Unit cost measure is too easy.) That means
each time you operate (read, write, add, dereference,...) with a number
of length x, you charge x time and x space.

Specify how the input and output look like, I don't think that the
asymptotical time depends too much on that. What is complexity of
sorting then?
.