C#: Good/best implementation of Swap method

Question

I read this post about card shuffling and in many shuffling and sorting algorithms you need to swap two items in a list or array. But what does a good and efficient Swap met

Answer 1

For anyone wondering, swapping can also be done also with Extension methods (.NET 3.0 and newer).

In general there seems not to be possibility to say that extension methods "this" value is ref, so you need to return it and override the old value.

public static class GeneralExtensions {
    public static T SwapWith(this T current, ref T other) {
        T tmpOther = other;
        other = current;
        return tmpOther;
    }
}

This extension method can be then used like this:

int val1 = 10;
int val2 = 20;    
val1 = val1.SwapWith(ref val2);