[알고리즘] Day2 - 2750번 수 정렬하기

01 문제

02 알고리즘

• 삽입정렬과 버블정렬에 대하여 오름차순 정렬을 했다.
  

03 코드

1_ sort.h

void insertion_sort(int N, int *num);

void bubble_sort(int N, int *num);

void print_num(int N, int *num);

 

void insertion_sort(int N, int *num)

{

       int i, j;

 

       for (i = 1; i < N; i++)

       {

               int key = i;

               for (j = i-1; j >= 0; j--)

               {

                      if (num[key] < num[j])

                      {

                              int tmp = num[key];

                              num[key] = num[j];

                              num[j] = tmp;

                              key = j;

                      }

                      print_num(N, num);

               }

       }

}

 

void bubble_sort(int N, int *num)

{

       int i, j;

       for (i = 0; i < N; i++)       // i는 반복을 위한 것

       {

               // 버블 정렬은 오른쪽 끝에서 시작

               for (j = N - 1; j >= 0; j--)

               {

                      if (num[j] < num[j-1])

                      {

                              int tmp = num[j];

                              num[j] = num[j-1];

                              num[j-1] = tmp;

                      }

                      print_num(N, num);

               }

       }

}

 

void print_num(int N, int *num)

{

       int i;

       printf("-> ");

       for (i = 0; i < N; i++)

       {

               printf("%d ", num[i]);

       }

       printf("\n");

}

2_ bubble_sort.cpp

#include "stdafx.h"

#include "sort.h"

//#include <stdio.h>

int main(void)

{

       int i, N;

       int num[1000] = { 0, };

       scanf("%d", &N);

       for (i = 0; i < N; i++)

               scanf("%d", &num[i]);

       print_num(N, num);

       bubble_sort(N, num);

       print_num(N, num);

       return 0;

}

3_ insertion.sort.cpp

#include "stdafx.h"

#include "sort.h"

//#include <stdio.h>

int main(void)

{

       int i, N;

       int num[1000] = { 0, };

       scanf("%d", &N);

       for (i = 0; i < N; i++)

               scanf("%d", &num[i]);

       print_num(N, num);

       insertion_sort(N, num);

       print_num(N, num);

       return 0;

}