-
Notifications
You must be signed in to change notification settings - Fork 15
/
Sort the Half Sorted
86 lines (73 loc) · 1.62 KB
/
Sort the Half Sorted
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
86
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
void sortHalves (int arr[], int n)
{
// your code here
vector<int>v;
int c = -1;
for(int i=0;i+1<n;i++)
{
if(arr[i]>arr[i+1])
c = i;
}
if(c==-1)
return;
int i = 0;
int j = c+1;
while(i<=c && j<=n-1)
{
if(arr[i]<arr[j])
{
v.push_back(arr[i]);
i++;
}
else
{
v.push_back(arr[j]);
j++;
}
}
if(i>c)
{
while(j<=n-1)
{
v.push_back(arr[j]);
j++;
}
}
else
{
while(i<=c)
{
v.push_back(arr[i]);
i++;
}
}
for(int j=0;j<n;j++)
{
arr[j] = v[j];
}
}
};
// { Driver Code Starts.
int main ()
{
int t; cin >> t;
while (t--)
{
int n; cin >> n;
int arr[n];
for (int i = 0; i < n; ++i)
cin >> arr[i];
Solution ob;
ob.sortHalves (arr, n);
for (int i = 0; i < n; ++i)
cout << arr[i] << " ";
cout << endl;
}
}
// Contributed By: Pranay Bansal // } Driver Code Ends