6.3w+
社区成员
#include <iostream>
#include<ctime>
#include <vector>
#include <algorithm>
#include<iomanip>
using namespace std;
class S
{
vector<int> a;
public:
int b;
S();
void beforesort(S c);
void sort(S c);
};
S::S()
{
srand((unsigned)time(NULL));
for(int i = 0; i < 100; i++ )
{
b = rand ( )%1000;
a.push_back(b);
}
}
void S::beforesort(S c)
{
cout<< "排列前:\n";
for( int i = 0; i < 100; i++ )
{
cout<< c.a[i]<<" ";
if ( ( i + 1 ) % 10 == 0 )
cout<<endl;
}
}
void S::sort(S c)
{
cout<< "排列后:\n";
std::sort(c.a.begin(), c.a.end());
for( int i = 0; i < 100; i++ )
{
cout<< c.a[i]<<" ";
if ( ( i + 1 ) % 10 == 0 )
cout << endl;
}
}
void main()
{
S a;
a.beforesort(a);
a.sort (a);
}
if (bCutPlane)
{
pTOC->nCounter++;
pTOC->dCoord = dCoor;
strcpy(pTOC->szBlock, "BLOCK: GetPath");
strcpy(pTOC->szReason, "REASON: Path cut plane");
fprintf(pTOC->pFile, "[%d]\n", pTOC->nCounter);
fprintf(pTOC->pFile, "Coordinate: %f\n");
fprintf(pTOC->pFile, "%s\n", pTOC->szBlock);
fprintf(pTOC->pFile, "%s\n\n", pTOC->szReason);
return PATH_CUT_PLANE;
}
if (bCutPlane)
{
pTOC->nCounter++;
pTOC->dCoord = dCoor;
strcpy(pTOC->szBlock, "BLOCK: GetPath");
strcpy(pTOC->szReason, "REASON: Path cut plane");
fprintf(pTOC->pFile, "[%d]\n", pTOC->nCounter);
fprintf(pTOC->pFile, "Coordinate: %f\n");
fprintf(pTOC->pFile, "%s\n", pTOC->szBlock);
fprintf(pTOC->pFile, "%s\n\n", pTOC->szReason);
return PATH_CUT_PLANE;
}
#include <iostream>
#include<ctime>
#include <vector>
#include <algorithm>
#include<iomanip>
using namespace std;
class S
{
vector<int> a;
public:
int b;
S();
void beforesort(S c);
void sort(S c);
};
S::S()
{
srand((unsigned)time(NULL));
for(int i = 0; i < 100; i++ )
{
b = rand ( )%1000;
a.push_back(b);
}
}
void S::beforesort(S c)
{
cout<< "排列前:\n";
for( int i = 0; i < 100; i++ )
{
cout<< setw(6) << c.a[i];
if ( ( i + 1 ) % 10 == 0 )
cout<<endl;
}
}
void S::sort(S c)
{
cout<< "排列后:\n";
std::sort(c.a.begin(), c.a.end());
for( int i = 0; i < 100; i++ )
{
cout<< setw(6) << c.a[i];
if ( ( i + 1 ) % 10 == 0 )
cout << endl;
}
}
void main()
{
S a;
a.beforesort(a);
a.sort (a);
}