imported>Unknown at 05:30, 7 February 2021

2021-02-07T05:30:45Z

New page

데블스 캠프 정렬 코드
----
첫번째 방법
#include <fstream>
using namespace std;

const int Asize=10000;

int main()
{
ifstream fin("unsortedData.txt"); //파일 이름이...삽질 1탄~!
ofstream fout("sorted.txt");

int sorted[Asize];

for (int i=0 ; i<Asize ; i++)
fin >> sorted[i];
int temp;
for (int j=0 ; j<Asize ; j++)
{
for (int k=0 ; k<Asize ; k++)
{
if (sorted[k] < sorted[j])
{
temp = sorted[k];
sorted[k] = sorted[j];
sorted[j] = temp;
}
}
}

while (i>0)
{
fout << sorted[i-1] << endl;
--i;
}

return 0;
}
----
[[데블스캠프2003/첫째날]], [[정렬]]

정렬/Leonardong - Revision history

imported>Unknown at 05:30, 7 February 2021