-
Notifications
You must be signed in to change notification settings - Fork 1
/
merge_srt.cpp
79 lines (55 loc) · 867 Bytes
/
merge_srt.cpp
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
//recursion
//merge sort
#include <bits/stdc++.h>
using namespace std;
#define ll long
// const int N=3005;
void merge (int *a, int s, int e){
int mid = (s+e)/2;
int i=s;
int k=s;
int j=mid+1;
int temp[10];
while(i<=mid && j<=e){
if(a[i]<a[j]){
temp[k++] = a[i++];
}
else temp[k++] = a[j++];
}
while(i<=mid){
temp[k++] = a[i++];
}
while(j<=e){
temp[k++] = a[j++];
}
// k--;
for(int i =0;i<=e;i++){
a[i]=temp[i];
}
}
void solve(int *a,int s, int e){
if(s>=e) return;
int mid = (s+e)/2;
solve(a,s,mid);
solve(a,mid+1,e);
merge(a,s,e);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("inputs.txt","r",stdin);
freopen("outputs.txt","w",stdout);
#endif
int n;
int a[10];
cin>>n;
// cout<<"test"<<endl;
for(int i =0;i<n;i++){
cin>>a[i];
}
solve(a,0,n-1);
for(int i =0;i<n;i++){
cout<<a[i];
}
return 0;
}