C# Array Sort(Array, Int32, Int32, IComparer)
Description
Array Sort(Array, Int32, Int32, IComparer)
sorts the
elements in a range of elements in a one-dimensional Array using the specified
IComparer.
Syntax
Array.Sort(Array, Int32, Int32, IComparer)
has the following syntax.
public static void Sort(
Array array,// w w w . j a v a 2 s .c o m
int index,
int length,
IComparer comparer
)
Parameters
Array.Sort(Array, Int32, Int32, IComparer)
has the following parameters.
array
- The one-dimensional Array to sort.index
- The starting index of the range to sort.length
- The number of elements in the range to sort.comparer
- The IComparer implementation to use when comparing elements.comparer
- -or-comparer
- null to use the IComparable implementation of each element.
Returns
Array.Sort(Array, Int32, Int32, IComparer)
method returns
Example
The following code example shows how to sort the values in an Array using the default comparer and a custom comparer that reverses the sort order.
/*w ww . java 2 s .c om*/
using System;
using System.Collections;
class myReverserClass : IComparer {
// Calls CaseInsensitiveComparer.Compare with the parameters reversed.
int IComparer.Compare( Object x, Object y ) {
return( (new CaseInsensitiveComparer()).Compare( y, x ) );
}
}
public class SamplesArray {
public static void Main() {
String[] myArr = { "A", "B", "C", "F", "E", "o", "t", "P", "D" };
IComparer myComparer = new myReverserClass();
Array.Sort( myArr, 1, 3 );
Array.Sort( myArr, 1, 3, myComparer );
Array.Sort( myArr );
Array.Sort( myArr, myComparer );
}
}
The code above generates the following result.