Sort and search an array of objects : Generic IComparable « Generic « C# / CSharp Tutorial

1. C# / CSharp Tutorial
2. Generic
3. Generic IComparable

using System;  
 
class MyClass : IComparable<MyClass> { 
  public int i; 
  
  public MyClass(int x) { 
     i = x; 
  } 
 
  // Implement IComparable<MyClass>. 
  public int CompareTo(MyClass v) { 
    return i - v.i; 
  } 
 
} 
  
class MainClass {     
  public static void Main() {     
    MyClass[] nums = new MyClass[5]; 
 
    nums[0] = new MyClass(5); 
    nums[1] = new MyClass(2); 
    nums[2] = new MyClass(3); 
    nums[3] = new MyClass(4); 
    nums[4] = new MyClass(1); 
   
    Console.Write("Original order: "); 
    foreach(MyClass o in nums)  
      Console.Write(o.i + " "); 
    Console.WriteLine(); 
 
    Array.Sort(nums); 
 
    Console.Write("Sorted order:   "); 
    foreach(MyClass o in nums)  
      Console.Write(o.i + " "); 
    Console.WriteLine(); 
 
    MyClass x = new MyClass(2); 
    int idx = Array.BinarySearch(nums, x); 
 
    Console.WriteLine("Index of MyClass(2) is " + idx); 
  }     
}

Original order: 5 2 3 4 1
Sorted order:   1 2 3 4 5
Index of MyClass(2) is 1