test 2.2-2
2015-08-26 20:18
337 查看
习题2.2-1是问答,结果是n^3, 2.2-3 和2.2-4都是这样子,我不太明白,不做回答。2.2-2我写了两个程序,第一个是按照题目意思写的,第二的是自己造的
#include<iostream>
#include<vector>
int main()
{
using namespace std;
vector<int> line;
cout << "Enter your integer array :";
int p;
while (cin >> p)
line.push_back(p);
int n = line.size();
for (int i = 0; i < n - 1; i++)
{
int mark; int temp = line[i];
for (int j = i + 1; j < n; j++)
{
if (line[j] < temp)
{
temp = line[j];
mark = j;
}
}
if (line[i]>temp)
{
line[mark] = line[i];
line[i] = temp;
}
}
for (int k = 0; k < n; k++)
cout << line[k] << ' ';
return 0;
}
#include<iostream>
#include<vector>
int main()
{
using namespace std;
cout << "Enter your integer array :";
int a; vector<int> line;
while (cin >> a)
line.push_back(a);
int n = line.size();
for (int i = 0; i <n-1; i++)
{
for (int j = i + 1; j < n; j++)
{
if (line[j] < line[i])
{
int temp = line[j];
line[j] = line[i];
line[i] = temp;
}
}
}
for (int i = 0; i < n; i++)
cout << line[i] << " ";
return 0;
}
#include<iostream>
#include<vector>
int main()
{
using namespace std;
vector<int> line;
cout << "Enter your integer array :";
int p;
while (cin >> p)
line.push_back(p);
int n = line.size();
for (int i = 0; i < n - 1; i++)
{
int mark; int temp = line[i];
for (int j = i + 1; j < n; j++)
{
if (line[j] < temp)
{
temp = line[j];
mark = j;
}
}
if (line[i]>temp)
{
line[mark] = line[i];
line[i] = temp;
}
}
for (int k = 0; k < n; k++)
cout << line[k] << ' ';
return 0;
}
#include<iostream>
#include<vector>
int main()
{
using namespace std;
cout << "Enter your integer array :";
int a; vector<int> line;
while (cin >> a)
line.push_back(a);
int n = line.size();
for (int i = 0; i <n-1; i++)
{
for (int j = i + 1; j < n; j++)
{
if (line[j] < line[i])
{
int temp = line[j];
line[j] = line[i];
line[i] = temp;
}
}
}
for (int i = 0; i < n; i++)
cout << line[i] << " ";
return 0;
}
相关文章推荐
- java算法导论之FloydWarshall算法实现代码
- Red-Black Tree 的Java实现
- 逆序对
- 算法导论之堆
- LCS 最长公共子序列
- 使用Java完成《算法导论》习题2.2-2
- 使用Java完成《算法导论》习题2.3-2
- 使用Java完成《算法导论》习题2.3-4
- 使用Java完成《算法导论》习题2.3-5
- 使用Java完成《算法导论》习题2.3-6
- 使用Java完成《算法导论》习题2.3-7
- 快速排序个人理解
- 笔记一(算法基础)
- Chapter2 Getting Started
- Chapter3 Growth of Functions
- 插入排序和归并排序
- 第2章 算法入门
- 编程资源共享导航(更新)
- 算法导论 第15章 动态规划之钢条切割
- Asymptotic Notation and Recurrences