Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
1
170050053-170050067-170050085-git
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
SUDHIR KUMAR
170050053-170050067-170050085-git
Commits
4f291b3f
Commit
4f291b3f
authored
Aug 27, 2018
by
RONGALI RAVI TEJA
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
change implementation to merge-sort
parent
0fb676da
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
46 additions
and
11 deletions
+46
-11
sorting.cpp
sorting.cpp
+46
-11
No files found.
sorting.cpp
View file @
4f291b3f
...
...
@@ -2,16 +2,51 @@
#include<vector>
#include "sorting.h"
using
namespace
std
;
vector
<
int
>
sort_custom
(
vector
<
int
>
r
){
for
(
int
i
=
0
;
i
<
r
.
size
();
i
++
){
for
(
int
j
=
r
.
size
()
-
1
;
j
>=
i
;
j
--
){
if
(
r
[
j
-
1
]
>
r
[
j
]){
int
temp
;
temp
=
r
[
j
-
1
];
r
[
j
-
1
]
=
r
[
j
];
r
[
j
]
=
temp
;
vector
<
int
>
merge
(
vector
<
int
>
left
,
vector
<
int
>
right
)
{
vector
<
int
>
result
;
while
((
int
)
left
.
size
()
>
0
||
(
int
)
right
.
size
()
>
0
)
{
if
((
int
)
left
.
size
()
>
0
&&
(
int
)
right
.
size
()
>
0
)
{
if
((
int
)
left
.
front
()
<=
(
int
)
right
.
front
())
{
result
.
push_back
((
int
)
left
.
front
());
left
.
erase
(
left
.
begin
());
}
else
{
result
.
push_back
((
int
)
right
.
front
());
right
.
erase
(
right
.
begin
());
}
}
else
if
((
int
)
left
.
size
()
>
0
)
{
for
(
int
i
=
0
;
i
<
(
int
)
left
.
size
();
i
++
)
result
.
push_back
(
left
[
i
]);
break
;
}
else
if
((
int
)
right
.
size
()
>
0
)
{
for
(
int
i
=
0
;
i
<
(
int
)
right
.
size
();
i
++
)
result
.
push_back
(
right
[
i
]);
break
;
}
}
}
return
r
;
}
return
result
;
}
vector
<
int
>
sort_custom
(
vector
<
int
>
m
)
{
if
(
m
.
size
()
<=
1
)
return
m
;
vector
<
int
>
left
,
right
,
result
;
int
middle
=
((
int
)
m
.
size
()
+
1
)
/
2
;
for
(
int
i
=
0
;
i
<
middle
;
i
++
)
{
left
.
push_back
(
m
[
i
]);
}
for
(
int
i
=
middle
;
i
<
(
int
)
m
.
size
();
i
++
)
{
right
.
push_back
(
m
[
i
]);
}
left
=
sort_custom
(
left
);
right
=
sort_custom
(
right
);
result
=
merge
(
left
,
right
);
return
result
;
}
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment