PAT1089
2018-02-09 20:31
85 查看
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<set>
#include<fstream>
using namespace std;
ifstream fin("1089.txt");
//#define cin fin
#define MAX 105
int n;
int num1[MAX], num2[MAX];
bool isready(int len)
{
int i, j;
for (i = 1; i <= n; i += len)
{
for (j = i; j < n&&j < i + len - 1; j++)
{
if (num2[j]>num2[j + 1])
return false;
}
}
return true;
}
int main()
{
cin >> n;
int i, j;
for (i = 1; i <= n; i++)
cin >> num1[i];
for (i = 1; i <= n; i++)
cin >> num2[i];
for (i = 1; i < n;i++)
if (num2[i]>num2[i + 1])
break;
for (j = i + 1; j <= n;j++)
if (num1[j] != num2[j])
break;
if (j == n + 1)
{
cout << "Insertion Sort\n";
sort(num2 + 1, num2 + i + 1 + 1);
for (i = 1; i <= n; i++)
{
cout << num2[i]; break;
}
for (++i; i <= n; i++)
{
cout << " " << num2[i];
}
return 0;
}
else
{
cout << "Merge Sort\n";
int len = 2;
while (isready(len))
len *= 2;
for (i = 1; i <= n; i += len)
{
if (i + len <= n)
sort(num2 + i, num2 + i + len);
else
sort(num2 + i, num2 + n + 1);
}
for (i = 1; i <= n; i++)
{
cout << num2[i]; break;
}
for (++i; i <= n; i++)
cout << " " << num2[i];
}
}
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<set>
#include<fstream>
using namespace std;
ifstream fin("1089.txt");
//#define cin fin
#define MAX 105
int n;
int num1[MAX], num2[MAX];
bool isready(int len)
{
int i, j;
for (i = 1; i <= n; i += len)
{
for (j = i; j < n&&j < i + len - 1; j++)
{
if (num2[j]>num2[j + 1])
return false;
}
}
return true;
}
int main()
{
cin >> n;
int i, j;
for (i = 1; i <= n; i++)
cin >> num1[i];
for (i = 1; i <= n; i++)
cin >> num2[i];
for (i = 1; i < n;i++)
if (num2[i]>num2[i + 1])
break;
for (j = i + 1; j <= n;j++)
if (num1[j] != num2[j])
break;
if (j == n + 1)
{
cout << "Insertion Sort\n";
sort(num2 + 1, num2 + i + 1 + 1);
for (i = 1; i <= n; i++)
{
cout << num2[i]; break;
}
for (++i; i <= n; i++)
{
cout << " " << num2[i];
}
return 0;
}
else
{
cout << "Merge Sort\n";
int len = 2;
while (isready(len))
len *= 2;
for (i = 1; i <= n; i += len)
{
if (i + len <= n)
sort(num2 + i, num2 + i + len);
else
sort(num2 + i, num2 + n + 1);
}
for (i = 1; i <= n; i++)
{
cout << num2[i]; break;
}
for (++i; i <= n; i++)
cout << " " << num2[i];
}
}
相关文章推荐
- *浙大PAT甲级 1089 归并排序与插入排序
- PAT (Advanced Level) Practise 1089 Insert or Merge (25)
- PAT 1089 (排序||归并,直接插入)
- pat 1089 Insert or Merge
- Pat(Advanced Level)Practice--1089(Insert or Merge )
- PAT(甲级)1089
- PAT1089【归并排序】
- PAT (Advanced Level) Practise 1089 Insert or Merge (25)
- pat1089 Insert or Merge
- pat 1089(两个点没有过)
- pat 1104. Sum of Number Segments
- Python实现Pat 1035. Password (20)
- PAT-L2-007- 家庭房产-gplt真题
- 浙江大学PAT上机题解析之1005. 继续(3n+1)猜想 (25)
- [PAT (Advanced Level) ]1015. Reversible Primes 解题文档
- 1083. List Grades (25)-PAT甲级
- 1070. 结绳(25) PAT乙级真题
- PAT Advanced 1145. Hashing - Average Search Time (25)
- 浙江大学PAT上机题解析之2-09. 装箱问题模拟
- 【PAT】1084. Broken Keyboard (20)