#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
void Order(vector<int>& data)
{
int count = data.size();
int tag = false;
for(int i=0; i<count; i++)
{
for(int j=0; j<count - i -1; j++)
{
if(data[j]>data[j+1])
{
tag = true;
int temp = data[j];
data[j] = data[j+1];
data[j+1] = temp;
}
}
if(!tag)
break;
}
}
int main()
{
vector<int> data;
ifstream in("c:\\data.txt");
if(!in)
{
cout<<"File error1!";
exit(1);
}
int temp;
while(!in.eof())
{
in>>temp;
data.push_back(temp);
}
in.close();
Order(data);
ofstream out("c:\\result.txt");
if(!out)
{
cout<<"File error2!";
exit(1);
}
for(int i=0;i<data.size();i++)
out<<data[i]<<" ";
out.close();
}
排序方法为冒泡排序
#include<fstream>
#include<vector>
using namespace std;
void Order(vector<int>& data)
{
int count = data.size();
int tag = false;
for(int i=0; i<count; i++)
{
for(int j=0; j<count - i -1; j++)
{
if(data[j]>data[j+1])
{
tag = true;
int temp = data[j];
data[j] = data[j+1];
data[j+1] = temp;
}
}
if(!tag)
break;
}
}
int main()
{
vector<int> data;
ifstream in("c:\\data.txt");
if(!in)
{
cout<<"File error1!";
exit(1);
}
int temp;
while(!in.eof())
{
in>>temp;
data.push_back(temp);
}
in.close();
Order(data);
ofstream out("c:\\result.txt");
if(!out)
{
cout<<"File error2!";
exit(1);
}
for(int i=0;i<data.size();i++)
out<<data[i]<<" ";
out.close();
}
排序方法为冒泡排序