forked from aalhour/C-Sharp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmerge_sort.cs
85 lines (73 loc) · 2.16 KB
/
merge_sort.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
76
77
78
79
80
81
82
83
84
85
using System;
namespace merge_sort
{
internal class Program
{
public static void MainMerge(int[] numbers, int left, int mid, int right)
{
var temp = new int[25];
int i, eol, num, pos;
eol = mid - 1;
pos = left;
num = right - left + 1;
while ((left <= eol) && (mid <= right))
{
if (numbers[left] <= numbers[mid])
{
temp[pos++] = numbers[left++];
}
else
{
temp[pos++] = numbers[mid++];
}
}
while (left <= eol)
{
temp[pos++] = numbers[left++];
}
while (mid <= right)
{
temp[pos++] = numbers[mid++];
}
for (i = 0; i < num; i++)
{
numbers[right] = temp[right];
right--;
}
}
public static void SortMerge(int[] numbers, int left, int right)
{
int mid;
if (right > left)
{
mid = (right + left) / 2;
SortMerge(numbers, left, mid);
SortMerge(numbers, mid + 1, right);
MainMerge(numbers, left, mid + 1, right);
}
}
private static void Main()
{
Console.WriteLine("Please enter some integers, separated by spaces:");
var input = Console.ReadLine();
var integers = input.Split(' ');
var data = new int[integers.Length];
for (var i = 0; i < data.Length; i++)
{
data[i] = int.Parse(integers[i]);
}
Console.Write("\nUnsorted: ");
for (var i = 0; i < data.Length; i++)
{
Console.Write(data[i] + " ");
}
SortMerge(data, 0, data.Length - 1);
Console.Write("\nSorted: ");
for (var i = 0; i < data.Length; i++)
{
Console.Write(data[i] + " ");
}
Console.ReadLine();
}
}
}