[»çÀ̹ö ¼ö¾÷17]
<Äü SORT>


<¹®Á¦> 'input.txt'ÆÄÀÏ¿¡¼­ ÁÖ¾îÁø k°³ÀÇ data¸¦ ÀÔ·Â¹Þ¾Æ ÄüSORTÇÑ ÈÄ 'output.txt'¿¡ Ãâ·ÂÇÏ´Â ÇÁ·Î±×·¥À» ÀÛ¼ºÇϽÿÀ!
(Á¶°Ç) dataÀÇ °¹¼ö´Â 100°³ÀÌÇÏ·Î ÇÕ´Ï´Ù.

k = <-ÀÔ·ÂÇÒ dataÀÇ °¹¼ö¸¦ ÀÔ·ÂÇϽÿÀ(data´Â 100°³ÀÌÇÏ)
input.txt



output.txt


(º¯¼ö¼±¾ð)
sort()ÇÔ¼ö¼±¾ð
(1´Ü°è)
'input()'ÇÔ¼ö·Î ±¸ºÐ
(2´Ü°è)
'process()'ÇÔ¼ö·Î ±¸ºÐ
(3´Ü°è)
'output()'ÇÔ¼ö·Î ±¸ºÐ
main()ÇÔ¼ö
#include<stdio.h>
#include<search.h>
int d[100]={0,}, k=0;
int sort(const void *a, const void *b){
     return (*(int*)a - *(int*)b);
}

int input()
{
    FILE *ifp;
    int i, a;
    
    ifp=fopen("input.txt","r");
    fscanf(ifp,"%d",&k);
    for(i=0;i<k;i++){
           fscanf(ifp,"%d",&d[i]);
    }
    fclose(ifp);

    return -1;
}




int process()
{


    qsort(d,k,sizeof(int),sort);

}




int output()
{
    FILE *ofp;
    int i;
    
    ofp=fopen("output.txt","w");
    for(i=0;i<k;i++){
         fprintf(ofp,"%d ",d[i]);
    }
    fclose(ofp);
    
    return -1;
}

int main()
{
    input();
    process();
    output();
    return -1;
}
d[], k´Â Àü¿ªº¯¼ö·Î ¼±¾ðÇØ¾ß ÇÕ´Ï´Ù.
sort()ÇÔ¼ö¼±¾ð°ú sort¹æ¹ýÀ» ¼±¾ðÇÕ´Ï´Ù.
ÀÔ·ÂÆÄÀÏ('input.txt')¿¡¼­ dataÀǰ¹¼ö(k)¿Í k°³ÀÇ data¸¦ Àоî¿Í d[]¿¡ ÀÔ·ÂÇÑ´Ù.
Äüsort °úÁ¤ÀÔ´Ï´Ù
´Ù¸¥sort¿Í ºñ±³ÇÏ¿© Â÷ÀÌÁ¡À» È®ÀÎÇϽñ⠹ٶø´Ï´Ù
2´Ü°èÀÇ SORT °úÁ¤À» ÅëÇØ ±¸ÇØÁø data¸¦ Ãâ·ÂÆÄÀÏ('output.txt')¿¡ Ãâ·ÂÇÑ´Ù.
main()ÇÔ¼ö¿¡¼­ ´Ù¸¥ÇÔ¼ö¸¦ call Çϰí ÀÖ½À´Ï´Ù

[Æò°¡ ¹®Á¦]
<¹®Á¦> 'input.txt'ÆÄÀÏ¿¡¼­ ÁÖ¾îÁø n°³ÀÇ data¸¦ ÀÔ·Â¹Þ¾Æ ÄüSORTÇÑ ÈÄ
¼¼¹øÂ° data¸¦ 'output.txt'¿¡ Ãâ·ÂÇÏ´Â ÇÁ·Î±×·¥À» ÀÛ¼ºÇϽÿÀ!
(Á¶°Ç) dataÀÇ °¹¼ö´Â 100°³ÀÌÇÏ·Î ÇÕ´Ï´Ù.