5.2. Reversing an Array Quickly
Problem
You want an efficient method to reverse the order of elements within an array.
Solution
You can use the static Reverse method, as in this snippet of code:
int[] someArray = new int[5] {1,2,3,4,5};
Array.Reverse(someArray);or you can write your own reversal method that extends the generic Array type:
public static void DoReversal<T>(this T[] theArray)
{
T tempHolder = default(T);
if (theArray == null)
throw new ArgumentNullException("theArray");
if (theArray.Length > 0)
{
for (int counter = 0; counter < (theArray.Length / 2); counter++)
{
tempHolder = theArray[counter];
theArray[counter] = theArray[theArray.Length - counter - 1];
theArray[theArray.Length - counter - 1] = tempHolder;
}
}
else
{
Trace.WriteLine("Nothing to reverse");
}
}While there is more code to write, the benefit of the DoReversal<T> method is that it is about twice as fast as the Array.Reverse method. In addition, you can tailor the DoReversal<T> method to a specific situation. For example, the DoReversal<T> method, when it is being jitted, knows what type T is and generates more efficient code, whereas the Array.Reverse method accepts only a reference type (System. Array), which treats the array as an array of objects. This means that you will incur the performance penalty of a boxing operation when storing value types in a nongeneric array, but you will incur a performance penalty from the extra time spent jitting the code when using a generic array. The DoReversal<T> method ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access