C-Sharp-Algorithms/Algorithms/Sorting/CycleSorter.cs at master · aalhour/C-Sharp-Algorithms · GitHub

Name: C-Sharp-Algorithms/Algorithms/Sorting/CycleSorter.cs at master · aalhour/C-Sharp-Algorithms · GitHub
Rating: 4.5 (731 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
usingSystem.Collections.Generic;

namespaceAlgorithms.Sorting
{
publicstaticclassCycleSorter
{

publicstaticvoidCycleSort<T>(thisIList<T>collection,Comparer<T>comparer=null)
{
comparer=comparer??Comparer<T>.Default;
collection.CycleSortAscending(comparer);
}

publicstaticvoidCycleSortDescending<T>(thisIList<T>collection,Comparer<T>comparer)
{
for(intcycleStart=0;cycleStart<collection.Count;cycleStart++)
{
Titem=collection[cycleStart];
intposition=cycleStart;

do
{
intto=0;
for(inti=0;i<collection.Count;i++)
{
if(i!=cycleStart&&comparer.Compare(collection[i],item)>0)
{
to++;
}
}
if(position!=to)
{
while(position!=to&&comparer.Compare(item,collection[to])==0)
{
to++;
}

Ttemp=collection[to];
collection[to]=item;
item=temp;
position=to;
}
}while(position!=cycleStart);
}
}

publicstaticvoidCycleSortAscending<T>(thisIList<T>collection,Comparer<T>comparer)
{
for(intcycleStart=0;cycleStart<collection.Count;cycleStart++)
{
Titem=collection[cycleStart];
intposition=cycleStart;

do
{
intto=0;
for(inti=0;i<collection.Count;i++)
{
if(i!=cycleStart&&comparer.Compare(collection[i],item)<0)
{
to++;
}
}
if(position!=to)
{
while(position!=to&&comparer.Compare(item,collection[to])==0)
{
to++;
}

Ttemp=collection[to];
collection[to]=item;
item=temp;
position=to;
}
}while(position!=cycleStart);
}
}
}
}