TanSanC

[Python] List 정렬 프로그램 구현

List 에 append 로 integer 값을 하나씩 넣은 후

오름차순 정렬하여 출력하는 프로그램

import sys

numberList =[]


for j in range(10):
    i = int(input("input: "))
    numberList.append(i)
    s1= 0
    print("Ori: {0}".format(numberList))
    while s1 < j:
        if numberList[s1] > numberList[s1+1]:
            numberList[s1] ^= numberList[s1+1]
            numberList[s1+1] ^= numberList[s1]
            numberList[s1] ^= numberList[s1+1]
        s1 = s1 + 1
    while s1 > 0:
        if numberList[s1] < numberList[s1-1]:
            numberList[s1] ^= numberList[s1-1]
            numberList[s1-1] ^= numberList[s1]
            numberList[s1] ^= numberList[s1-1]
        s1 = s1 - 1
    print("Sorted: {0}".format(numberList))

print(numberList)

import sys

numberList =[]
indexList =[]


for j in range(10):
    i = int(input("input: "))
    numberList.append(i)
    indexList.append(0)
    for k in range(len(numberList)-1):
        if i < numberList[k]:
            indexList[k] = indexList[k] + 1
        else:
            indexList[j] = indexList[j] + 1
    print("Ori: {0}".format(numberList))
    print("Sorted: {0}".format(indexList))
    for k1 in range(len(numberList)):
        for k2 in range(len(numberList)):
            if k1 == indexList[k2]:
                sys.stdout.write(str(numberList[k2]))
                sys.stdout.write(" ")
                break
    sys.stdout.write("\n")

print(numberList)

import java.util.Scanner;

public class Exercise {

     public static void main(String[] arg) {

          int[] arr = new int[10];

          Scanner sc = new Scanner(System.in);

          for (int i = 0; i < 10; i++) {

              arr[i] = sc.nextInt();

          }

          // 입력

          Sort(arr);

          // 출력

          for (int i = 0; i < 10; i++) {

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

          }

     }

     public static void Sort(int[] a) {

          int n = 10;

          int temp;

          int j;

          boolean move;

          for( int i = 1; i < n ; i = i + 1)

          {

              temp = a[i];

              j = i;

              if( a[j-1] > temp )

              {

                   move = true;                

              }

              else

              {

                   move = false;

              }

              while(move)

              {

                   a[j] = a[j-1];

                   j = j - 1 ;

                   if( j > 0 && a[j-1] > temp)

                   {

                        move = true;

                   }

                   else

                   {

                        move = false;

                   }

              }

              a[j] = temp;

          }

     }

}

#include <stdio.h>

void printArr(int *x, int size);

void sortArr(int *x, int size);

int main( )

{

    int arr[10] = { 1503, 2420, 11350, 3110, 20

        ,153, 220, 350, 34110, 2011 };

    printArr(arr, 10);

    sortArr(arr, 10);

    printArr(arr, 10);

    return 0;

}

void printArr(int *x, int size)

{

    int i;

    printf("printArr==\n");

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

    {

        printf("%d\n", x[i]);

    }

}  

void sortArr(int *x, int size)

{

    int temp, i, j;

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

    {

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

        {

            if( x[i] < x[j] )

            {

                temp = x[i];

                x[i] = x[j];

                x[j] = temp;

            }

        }

    }

}

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

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]);

       }

   }

}