forked from aalhour/C-Sharp-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
OddEvenSorter.cs
75 lines (70 loc) · 2.31 KB
/
OddEvenSorter.cs
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
using System.Collections.Generic;
using Algorithms.Common;
namespace Algorithms.Sorting
{
/// <summary>
/// Based on bubble sort
/// </summary>
public static class OddEvenSorter
{
public static void OddEvenSort<T>(this IList<T> collection, Comparer<T> comparer = null)
{
comparer = comparer ?? Comparer<T>.Default;
collection.OddEvenSortAscending(comparer);
}
/// <summary>
/// Public API: Sorts ascending
/// </summary>
public static void OddEvenSortAscending<T>(this IList<T> collection, Comparer<T> comparer)
{
bool sorted = false;
while (!sorted)
{
sorted = true;
for (var i = 1; i < collection.Count - 1; i += 2)
{
if (comparer.Compare(collection[i], collection[i + 1]) > 0)
{
collection.Swap(i, i + 1);
sorted = false;
}
}
for (var i = 0; i < collection.Count - 1; i += 2)
{
if (comparer.Compare(collection[i], collection[i + 1]) > 0)
{
collection.Swap(i, i + 1);
sorted = false;
}
}
}
}
/// <summary>
/// Public API: Sorts descending
/// </summary>
public static void OddEvenSortDescending<T>(this IList<T> collection, Comparer<T> comparer)
{
bool sorted = false;
while (!sorted)
{
sorted = true;
for (var i = 1; i < collection.Count - 1; i += 2)
{
if (comparer.Compare(collection[i], collection[i + 1]) < 0)
{
collection.Swap(i, i + 1);
sorted = false;
}
}
for (var i = 0; i < collection.Count - 1; i += 2)
{
if (comparer.Compare(collection[i], collection[i + 1]) < 0)
{
collection.Swap(i, i + 1);
sorted = false;
}
}
}
}
}
}