정렬 알고리즘

< simple, slow>

Bubble sort

Insertion sort

Selection sort

 

<fast>

Quick sort

Merge sort

Heap sort

 

<O(N)>

Radix sort

============================================

 

Selection sort

 

▣ Bubble sort

 

 bubbleSort(A[ ]. n)   -> 배열 A[1....n]을 정렬한다.

{ 

   for last  <- n downto 2 {

        for i <- 1 to last-1 

            if (A[ i ] > A[ i + 1] ) then A[ i ] <-> A[ i  + 1];  >> 교환