数据结构C#实现

//选择排序class SelectionSorter{private int min;public void Sort(int[] arr){for (int i = 0; i < arr.Length - 1; ++i){min = i;for (int j = i + 1; j < arr.Length; ++j){if (arr[j] < arr[min])min = j;}int t = arr[min];arr[min] = arr[i];arr[i] = t;}}static void Main(string[] args){int[] array = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };SelectionSorter s = new SelectionSorter();s.Sort(array);foreach (int m in array)Console.WriteLine("{0}", m);}}//冒泡排序class EbullitionSorter{public void Sort(int[] arr){int i, j, temp;bool done = false;j = 1;while ((j < arr.Length) && (!done))//判断长度{done = true;for (i = 0; i < arr.Length - j; i++){if (arr[i] > arr[i + 1]){done = false;temp = arr[i];arr[i] = arr[i + 1];//交换数据arr[i + 1] = temp;}}j++;}}static void Main(string[] args){int[] array = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };EbullitionSorter e = new EbullitionSorter ();e.Sort(array);foreach (int m in array)Console.WriteLine("{0}", m);}}//快速排序class QuickSorter{private void swap(ref int l, ref int r){int temp;temp = l;l = r;r = temp;}public void Sort(int[] list, int low, int high){int pivot;//存储分支点int l, r;int mid;if (high <= low)return;else if (high == low + 1){if (list[low] > list[high])swap(ref list[low], ref list[high]);return;}mid = (low + high) >> 1;pivot = list[mid];swap(ref list[low], ref list[mid]);l = low + 1;r = high;do{while (l <= r && list[l] < pivot)l++;while (list[r] >= pivot)r--;if (l < r)swap(ref list[l], ref list[r]);} while (l < r);list[low] = list[r];list[r] = pivot;if (low + 1 < r)Sort(list, low, r - 1);if (r + 1 < high)Sort(list, r + 1, high);}static void Main(string[] args){int[] iArrary = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };QuickSorter q = new QuickSorter();q.Sort(iArrary, 0, 13);for (int m = 0; m <= 13; m++)Console.WriteLine("{0}", iArrary[m]);}}//插入排序public class InsertionSorter{public void Sort(int[] arr){for (int i = 1; i < arr.Length; i++){int t = arr[i];int j = i;while ((j > 0) && (arr[j - 1] > t)){arr[j] = arr[j - 1];//交换顺序--j;}arr[j] = t;}}static void Main(string[] args){int[] array = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };InsertionSorter i = new InsertionSorter();i.Sort(array);foreach (int m in array)Console.WriteLine("{0}", m);}}//希尔排序public class ShellSorter{public void Sort(int[] arr){int inc;for (inc = 1; inc <= arr.Length / 9; inc = 3 * inc + 1) ;for (; inc > 0; inc /= 3){for (int i = inc + 1; i <= arr.Length; i += inc){int t = arr[i - 1];int j = i;while ((j > inc) && (arr[j - inc - 1] > t)){arr[j - 1] = arr[j - inc - 1];//交换数据j -= inc;}arr[j - 1] = t;}}}static void Main(string[] args){int[] array = new int[] { 1, 5, 3, 6, 10, 55, 9, 2, 87, 12, 34, 75, 33, 47 };ShellSorter s = new ShellSorter();s.Sort(array);foreach (int m in array)Console.WriteLine("{0}", m);}}先我们给树下一个定义：树是一个有限的、非空的结点集首先我们给树下一个定义：树是一个有限的、非空的结点集，T={r} or T1 or T2 or…or Tn它具有下列性质：1．集合指定的结点r叫做树的根结点2．其余的结点可以划分成n个子集，T1,T2,…Tn(n>=0),其中每一个子集都是一棵树。

树的其它定义如度，叶子，高等就请大家查阅别的资料吧，到处都有的。

树的主要性质一个就是遍历，分为深度遍历和广度遍历在这里分别实现为DepthFirstTravesal()和WidthFirstTravesal()其中深度遍历又分为前序遍历、中序遍历、和后序遍历这是是采用适配器技术实现的。

using System;using System.Collections;namespace DataStructure{/// <summary>/// Tree 的摘要说明。

/// when traverse, traversaltype can't be changed,or throw a exception/// 支持枚举、比较、深度复制/// </summary>public abstract class Tree:IEnumerable,IComparable{public Tree(){//// TODO: 在此处添加构造函数逻辑//}protected Queue keyqueue=new Queue();//仅仅用于枚举时存放数据，不参与Equals实现中的比较protected TraversalType traversaltype=TraversalType.Breadth;// choose atraversal type,and DepthFirst is default//protected uint degree=0;//degree of the tree, init it as 0//protected uint height=0;//height of the tree, init it as 0//枚举不同的遍历类型public enum TraversalType{Breadth=1,//广度遍历PreDepth=2,//前序遍历InDepth=3,//中序遍历PostDepth=4//后序遍历};//public virtual abstract object Key{}public abstract Tree this[uint _index]{get;set;}//if I only use get, can I change it later?public abstract object Key{get;}public abstract uint Degree{get;}//public abstract uint Height{get;}public void SetTraversalType(TraversalType _type){traversaltype=_type;}//set a traversal a type, if it's not set manually, DepthFirst will be chosen in defaultpublic abstract bool IsEmpty();// property takes the place of IsEmpty()public abstract bool IsLeaf();//Only Visit, needn't queuepublic virtual void DepthFirstTraversal(IPrePostVisitor _vis)//middle depthfirst traversal{//通过_vis使用不同的访问者来进行前序、后序、中序遍历if(!IsEmpty()){_vis.PreVisit(this.Key);if( this.Degree>=1 ){if( this.Degree>=2){for(uint i=0;i<(this.Degree-1);i++)//{this[i].DepthFirstTraversal(_vis);//recursive call//_vis.Visit(this.Key);}}this[this.Degree-1].DepthFirstTraversal(_vis);}_vis.PostVisit(this.Key);}}public virtual void BreadthFirstTraversal(IVisitor _vis)//breadth first traversal {Queue tmpQueue=new Queue();//used to help BreadthFirstTraversal//this.keyqueue=new Queue();//store keysif(!this.IsEmpty())tmpQueue.Enqueue(this);//enqueue the root node at firstwhile(tmpQueue.Count!=0)//until the number of the queue is zero{Tree headTree=(Tree)tmpQueue.Dequeue();//this.keyqueue.Enqueue(headTree.Key);_vis.Visit(headTree.Key);for(uint i=0;i<headTree.Degree;i++){Tree childTree=headTree[i];if(!childTree.IsEmpty())tmpQueue.Enqueue(childTree);}}}//------------------------------------------------end------------------------------------ //内部成员类用于提供不同遍历类型的访问者public class PreOrder:IPrePostVisitor{private IVisitor visitor;public PreOrder(IVisitor _vis){visitor=_vis;}#region IPrePostVisitor 成员public void PreVisit(object _obj){// TODO: 添加 PreOrder.PreVisit 实现this.visitor.Visit(_obj);}public void Visit(object _obj){// TODO: 添加 PreOrder.Visit 实现}public void PostVisit(object _obj){// TODO: 添加 PreOrder.PostVisitor 实现}#endregion}数据结构与算法(C#实现)系列---树(二)public class InOrder:IPrePostVisitor{private IVisitor visitor;public InOrder(IVisitor _vis){visitor=_vis;} #region IPrePostVisitor 成员public void PreVisit(object _obj){// TODO: 添加 InOrder.PreVisit 实现}public void Visit(object _obj){// TODO: 添加 InOrder.Visit 实现this.visitor.Visit(_obj);}public void PostVisit(object _obj){// TODO: 添加 InOrder.PostVisitor 实现 }#endregion}public class PostOrder:IPrePostVisitor{private IVisitor visitor;public PostOrder(IVisitor _vis){visitor=_vis;} #region IPrePostVisitor 成员public void PreVisit(object _obj){// TODO: 添加 PostOrder.PreVisit 实现}public void Visit(object _obj){// TODO: 添加 PostOrder.Visit 实现}public void PostVisit(object _obj){// TODO: 添加 PostOrder.PostVisitor 实现 this.visitor.Visit(_obj);}#endregion}protected class EnumVisitor:IVisitor{Queue thisQueue;public EnumVisitor(Queue _que){this.thisQueue=_que;}#region IVisitor 成员public void Visit(object _obj){// TODO: 添加 EnumVisitor.Visit 实现this.thisQueue.Enqueue(_obj);}#endregion}#region IEnumerable 成员public IEnumerator GetEnumerator(){// TODO: 添加 Tree.GetEnumerator 实现EnumVisitor vis=new EnumVisitor(this.keyqueue); switch (this.traversaltype){case TraversalType.Breadth:BreadthFirstTraversal(vis);break;case TraversalType.PreDepth:PreOrder preVis=new PreOrder(vis);DepthFirstTraversal(preVis); break;case TraversalType.InDepth:InOrder inVis=new InOrder(vis);DepthFirstTraversal(inVis);break;case TraversalType.PostDepth:PostOrder postVis=new PostOrder(vis);DepthFirstTraversal(postVis);break;default:Console.WriteLine("WARNING:please set a travel type first!--void SetTraversalType(TraversalType _type) ");//throw new Exception("WARNING:please set a travel type first!");//if not set a type, a exception will happenbreak;}return this.keyqueue.GetEnumerator();}#endregion数据结构与算法(C#实现)系列---树(三)//overwrite Object.Equals() --- reference type realizationpublic override bool Equals(object _obj){if( _obj==null )return false;//因为this不可能为nullif( ! (this.GetType()==_obj.GetType()) )return false;//类型不相等也不相等Tree tmpObj=(Tree)_obj;//比较引用成员if( !Object.Equals(this.Key,tmpObj.Key) )return false;//比较值类型成员if( !this.Degree.Equals(tmpObj.Degree) )return false;//if( !this.Height.Equals(tmpObj.Height) )//return false;return true;}//在此重载 ==,!= 后，在以后继承的类中不必实现了 public static bool operator==(Tree _treeA,Tree _treeB) {return Object.Equals(_treeA,_treeB);}public static bool operator!=(Tree _treeA,Tree _treeB){return !(_treeA==_treeB);}#region IComparable 成员public virtual int CompareTo(object obj) {// TODO: 添加 pareTo 实现 return 0;}#endregion}}。