Abstract the CommonSorting trait in order to support mutable and immutable collections about scala-algorithms HOT 3 CLOSED

some people claims that the known sorting algorithms would not actually be the same if implemented without loops and mut-vars

As in "it's not quick-sort if you don't do mutation in-place"

The reasoning is that you usually lose the ability keep the same time-space analysis results.

from scala-algorithms.

In general I'd rename the GeneralSorting to Sorting, anyway

from scala-algorithms.

some people claims that the known sorting algorithms would not actually be the same if implemented without loops and mut-vars

As in "it's not quick-sort if you don't do mutation in-place"

The reasoning is that you usually lose the ability keep the same time-space analysis results.

This change would be more like an exercise than anything else. What is more, we will be able to show the differences between the two approaches and the time/space complexity. We can stress on this educational aspect in the scaladoc.

In general I'd rename the GeneralSorting to Sorting, anyway

It makes sense. I agree with you. ;)

from scala-algorithms.