TanSanC

선택 정렬 ========

void sortArr(int *x)

{

    int smaller;

    int smallIndex;

    int temp, i, j;

    for( j = 0 ; j < 5 - 1 ; j++ )

    {

        smaller = x[j];

        smallIndex = j;

        for( i = j+1; i < 5 ; i++)

        {

            if ( smaller > x[i] )

            {

                smaller = x[i];     smallIndex = i;

            }

        }

        temp = x[j];

        x[j] = x[smallIndex];

        x[smallIndex] = temp;

    }

}

버블 정렬 ===============

void sortArr(int *x)

{

    int i, temp, j;

    for(j = 1; j < 5 ; j++)

    {

        for( i = 0 ; i < 5-j ; i++ )

        {

            if ( x[i] > x[i+1] )

            {

                temp = x[i];

                x[i] = x[i+1];

                x[i+1] = temp;

            }

        }

    }

}

package com.tistory.tansanc.mainClass;

import java.util.Scanner;

public class ComputerTest {

   public static void main(String[] args) {

       int[] array = { 3, 9, 7, 1, 2, 5 };

       // { 3, 7, 1, 2, 5, 9 };

       // { 3, 1, 2, 5, 7, 9 };

       // { 1, 2, 3, 5, 7, 9 };

       int i, j;

      for( j = 0 ; j < array.length - 1; j++ )

       {

          for( i = 0 ; i < array.length - j - 1;

                 i++ )

          {

             if ( array[i] > array[i+1] )

             {

                 int temp = array[i];

                 array[i] = array[i+1];

                 array[i+1] = temp;

             }           

          }

       }

       for( i = 0 ; i < array.length ; i++ )

       {     

          System.out.println(array[i]);

       }

   }

}