How to make a "universal" sort?

Question

.NET

In general, I'm dealing with quicksort here, and when I started writing, I ran into the problem of static typing. Algorithm for int double long etc. is no different, but due to type differences, you need to produce overloads and therefore there is a huge duplication of code. Is there any way to avoid this?
PS
dynamic is not suitable because the performance goes into oblivion.

Answer 1

If I understand you correctly, then you can use the generic type constraint to IComparable, it is implemented by all primitives.

public IEnumerable<T> Sort<T>(IEnumerable<T> collection) where T : IComparable
    {
      foreach(var item in collection)
      {
        var result = item.CompareTo(new object()/* <- объект для сравнения */);
        // и так далее
      }
    }

Answer 2

Generic Templates (Programmer's Guide...

Answer 3

Generics