分析:
要实现的就是一个排序器。
代码如下:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Shangji1_06
{
public class Chair : IComparable
{
public double myPrice;
public string myVendor, myID;
public Chair() { }
public Chair(double price, string vendor, string sku)
{
myPrice = price;
myVendor = vendor;
myID = sku;
}
int IComparable.CompareTo(Object obj)
{
if (obj is Chair)
{
Chair castObj = (Chair)obj;
int result = String.CompareOrdinal(this.myID, castObj.myID);
if (result>0) return -1;
else if (result<0) return 1;
else return 0;
}
throw new ArgumentException("object is not a Chair");
}
}
class Program
{
static void Main(string[] args)
{
Chair chair1 = new Chair(100, "test1", "10001");
Chair chair2 = new Chair(100, "test2", "10002");
Chair chair3 = new Chair(100, "test3", "10003");
Chair chair4 = new Chair(100, "test4", "10005");
Chair chair5 = new Chair(100, "test5", "10004");
Chair[] chairs = new Chair[5] { chair1, chair2, chair3, chair4, chair5 };
Array.Sort(chairs);
Console.WriteLine("排序后,依次为:");
foreach(Chair chair in chairs)
{
Console.Write(chair.myID+" ");
}
Console.ReadKey();
}
}
}