백준 | 2750 | 수 정렬하기

using System;
using System.Linq;
 
namespace _2750
{
    class Program
    {
        static void Main(string[] args)
        {
            var p = new Problem();
            p.Solution(6);
        }
    }
 
    public class Problem{
        private int[] arr;
        public void Solution(int n){
            arr = new int[n];
            int count = 0;
            while(true){
                if(count >= n) break;
                var input = Console.ReadLine();
                var num = int.Parse(input);
                arr[count] = num;
                count++;
            }
 
 
            var e = this.arr.Distinct().ToArray();
            Array.Sort(e);
            foreach(var num in e){
                Console.WriteLine(num);
            }
            
        }
    }
}
 

 

 

버블 정렬

 

javascript

 
function bubbleSort1(arr){
    bubbleSort2(arr, arr.length - 1);
}
 
function bubbleSort2(arr, last){
    if(last>0){
        for(let i = 1; i<= last; i++){
            if(arr[i-1] > arr[i]){
                swap(arr, i-1, i);
            }
        }
        bubbleSort2(arr, last-1);
    }
}
 
function swap(arr, source, target){
    let temp = arr[source];
    arr[source] = arr[target];
    arr[target] = temp;
}
 
function print(arr){
    console.log(arr);
}
 
let arr = [3,5,4,2,1];
 
print(arr);
bubbleSort1(arr);
print(arr);

 

삽입 정렬