1、下面分别给出并行排序和归并排序的代码:并行排序类 ParallelSortParalletsort 类是一个通用的泛型,调用起来非常简单,下面给一个简单的int型数组的排序示例:class IntComparer : IComparer IComparer Members #region IComparer Memberspublic int Compare( int x, int y)return x.CompareTo(y);#endregionpublic void SortInt( int array)Sort.ParallelSort parallelSort = new Sort.
2、ParallelSort ();parallelSort.Sort(array, new IntComparer();只要实现一个T类型两两比较的接口,然后调用ParallelSort 的 Sort 方法就可以了,是不是很简单?下面是 ParallelSort类的代码using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Threading;namespace Sort/*/ / ParallelSort/public class ParallelSort en
3、um StatusIdle = 0 ,Running = 1 ,Finish = 2 ,class ParallelEntitypublic Status Status;public T Array;public IComparer Comparer;public ParallelEntity(Status status, T array, IComparer comparer)Status = status;Array = array;Comparer = comparer;private void ThreadProc(Object stateInfo)ParallelEntity pe
4、= stateInfo as ParallelEntity;lock (pe)pe.Status = ParallelSort .Status.Running;Array.Sort(pe.Array, pe.Comparer); .Status.Finish;public void Sort(T array, IComparer / Calculate process countint processorCount = Environment.ProcessorCount;/ If array.Length too short, do not use Parallel sortif (proc
5、essorCount = 1 | array.Length processorCount)Array.Sort(array, comparer);return ;/ Split arrayParallelEntity partArray = new ParallelEntityprocessorCount;int remain = array.Length;int partLen = array.Length / processorCount;/ Copy data to splited arrayfor ( int i = 0 ; i processorCount; i + )if (i =
6、 processorCount - 1 )partArrayi = new ParallelEntity(Status.Idle, new Tremain, comparer);elsepartArrayi = new ParallelEntity(Status.Idle, new TpartLen, comparer);remain -= partLen;Array.Copy(array, i * partLen, partArrayi.Array, 0 , partArrayi.Array.Length);/ Parallel sort processorCount - 1 ;Thread
7、Pool.QueueUserWorkItem( new WaitCallback(ThreadProc), partArrayi);ThreadProc(partArrayprocessorCount - 1 );/ Wait all threads finishwhile ( true )lock (partArrayi)if (partArrayi.Status = ParallelSort .Status.Finish)break ;Thread.Sleep( 0 );/ Merge sortMergeSort mergeSort = new MergeSort List source
8、= new List (processorCount);foreach (ParallelEntity pe in partArray)source.Add(pe.Array);mergeSort.Sort(array, source, comparer);多路归并排序类 MergeSort/ MergeSortpublic class MergeSort public void Sort(T destArray, List source, IComparer / Merge Sortint mergePoint = new int source.Count; source.Count;mer
9、gePointi = 0 ;int index = 0 ;while (index = sourcei.Length)continue ;if (min 0 )min = i;if (comparer.Compare(sourceimergePointi, sourceminmergePointmin) public int Compare(Vector c1, Vector c2)if (c1 = null | c2 = null )throw new ArgumentNullException( Both objects must not be null );double x = Math
10、.Sqrt(Math.Pow(c1.X, 2 )+ Math.Pow(c1.Y, 2 )+ Math.Pow(c1.Z, 2 )+ Math.Pow(c1.W, 2 );double y = Math.Sqrt(Math.Pow(c2.X, 2 )+ Math.Pow(c2.Y, 2 )+ Math.Pow(c2.Z, 2 )+ Math.Pow(c2.W, 2 );if (x y)return 1 ;else if (x c2.T)else if (c1.T internal class Programprivate static void Print(Vector vectors)/ fo
11、reach (Vector v in vectors)/ / Console.WriteLine(v.T);/ private static void Main( string args)Vector vectors = GetVectors();Console.WriteLine( string .Format( n = 0 , vectors.Length);Stopwatch watch1 = new Stopwatch();watch1.Start();A(vectors);watch1.Stop();Console.WriteLine( A sort time: + watch1.E
12、lapsed);Print(vectors);vectors = GetVectors();watch1.Reset();B(vectors); B sort time:C(vectors); C sort time:D(vectors); D sort time:Console.ReadKey();private static Vector GetVectors()int n = 1 21 ;Vector vectors = new Vectorn;Random random = new Random(); n;vectorsi = new Vector();vectorsi.X = ran
13、dom.NextDouble();vectorsi.Y = random.NextDouble();vectorsi.Z = random.NextDouble();vectorsi.W = random.NextDouble();return vectors;private static void A(Vector vectors)Array.Sort(vectors, new VectorComparer();private static void B(Vector vectors)int n = vectors.Length;Vector c1 = vectorsi;c1.T = Mat
14、h.Sqrt(Math.Pow(c1.X, 2 )Array.Sort(vectors, new VectorComparer2();private static void C(Vector vectors)c1.T = Math.Sqrt(c1.X * c1.X+ c1.Y * c1.Y+ c1.Z * c1.Z+ c1.W * c1.W);Array.Sort(vectors, new VectorComparer2();private static void D(Vector vectors)parallelSort.Sort(vectors, new VectorComparer2();
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1