forked from aalhour/C-Sharp-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathShellSorter.cs
More file actions
58 lines (55 loc) · 1.75 KB
/
Copy pathShellSorter.cs
File metadata and controls
58 lines (55 loc) · 1.75 KB
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
using System.Collections.Generic;
using Algorithms.Common;
namespace Algorithms.Sorting
{
public static class ShellSorter
{
public static void ShellSort<T>(this IList<T> collection, Comparer<T> comparer = null)
{
comparer = comparer ?? Comparer<T>.Default;
collection.ShellSortAscending(comparer);
}
/// <summary>
/// Public API: Sorts ascending
/// </summary>
public static void ShellSortAscending<T>(this IList<T> collection, Comparer<T> comparer)
{
bool flag = true;
int d = collection.Count;
while (flag || (d > 1))
{
flag = false;
d = (d + 1) / 2;
for (int i = 0; i < (collection.Count - d); i++)
{
if (comparer.Compare(collection[i + d], collection[i]) < 0)
{
collection.Swap(i + d, i);
flag = true;
}
}
}
}
/// <summary>
/// Public API: Sorts descending
/// </summary>
public static void ShellSortDescending<T>(this IList<T> collection, Comparer<T> comparer)
{
bool flag = true;
int d = collection.Count;
while (flag || (d > 1))
{
flag = false;
d = (d + 1) / 2;
for (int i = 0; i < (collection.Count - d); i++)
{
if (comparer.Compare(collection[i + d], collection[i])>0)
{
collection.Swap(i+d,i);
flag = true;
}
}
}
}
}
}