FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
CSharp-Programs/MergeSort/MergeSort/Program.cs at master · PranamBhat/CSharp-Programs · GitHub
PranamBhat
/
CSharp-Programs
Public
Notifications
You must be signed in to change notification settings
Fork
1
Star
1
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
CSharp-Programs
/
MergeSort
/
MergeSort
/
Program.cs
Copy path
More file actions
More file actions
Latest commit
History
History
History
61 lines (57 loc) · 1.74 KB
Breadcrumbs
CSharp-Programs
/
MergeSort
/
MergeSort
/
Program.cs
Copy path
File metadata and controls
61 lines (57 loc) · 1.74 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/*
* C# Program to Perform Merge Sort
*/
using
System
;
using
System
.
Collections
.
Generic
;
using
System
.
Text
;
namespace
prog
{
class
Program
{
static
public
void
mergemethod
(
int
[
]
numbers
,
int
left
,
int
mid
,
int
right
)
{
int
[
]
temp
=
new
int
[
25
]
;
int
i
,
left_end
,
num_elements
,
tmp_pos
;
left_end
=
(
mid
-
1
)
;
tmp_pos
=
left
;
num_elements
=
(
right
-
left
+
1
)
;
while
(
(
left
<=
left_end
)
&&
(
mid
<=
right
)
)
{
if
(
numbers
[
left
]
<=
numbers
[
mid
]
)
temp
[
tmp_pos
++
]
=
numbers
[
left
++
]
;
else
temp
[
tmp_pos
++
]
=
numbers
[
mid
++
]
;
}
while
(
left
<=
left_end
)
temp
[
tmp_pos
++
]
=
numbers
[
left
++
]
;
while
(
mid
<=
right
)
temp
[
tmp_pos
++
]
=
numbers
[
mid
++
]
;
for
(
i
=
0
;
i
<
num_elements
;
i
++
)
{
numbers
[
right
]
=
temp
[
right
]
;
right
--
;
}
}
static
public
void
sortmethod
(
int
[
]
numbers
,
int
left
,
int
right
)
{
int
mid
;
if
(
right
>
left
)
{
mid
=
(
right
+
left
)
/
2
;
sortmethod
(
numbers
,
left
,
mid
)
;
sortmethod
(
numbers
,
(
mid
+
1
)
,
right
)
;
mergemethod
(
numbers
,
left
,
(
mid
+
1
)
,
right
)
;
}
}
static
void
Main
(
string
[
]
args
)
{
int
[
]
numbers
=
{
3
,
8
,
7
,
5
,
2
,
1
,
9
,
6
,
4
}
;
int
len
=
9
;
Console
.
WriteLine
(
"MergeSort :"
)
;
sortmethod
(
numbers
,
0
,
len
-
1
)
;
for
(
int
i
=
0
;
i
<
9
;
i
++
)
Console
.
WriteLine
(
numbers
[
i
]
)
;
Console
.
Read
(
)
;
}
}
}
Back
|
FazBrowse Home
|
New Git URL