选择排序

选择排序

时间复杂度：$\Theta \left(n^2\right)$

---

该算法主旨：
首先找到数组中最小的元素，与数组的第一个元素进行交换。然后找到数组中次最小得元素，与数组得第二个元素进行交换。如此循环到排序完成。

---

伪代码：

SELECTION-SORT(A)
1   for i = 1 to A.length
2       Min = A[i]
3       Number = i
4       for j = i + 1 to A.length
5           if A[j] < Min
6               Min = A[j]
7               Number = j
8       A[Number] = A[i]
9       A[i] = Min

C++代码：

void SELECTION_SORT(int *A, int length)
{    
    for (int i = 0; i < length; i++)    
    {        
        int Min = A[i];        
        int Number = i;
        
        for (int j = i + 1; j < length; j++)        
        {            
            if (A[j] < Min)            
            {                
                Min = A[j];                
                Number = j;            
            }        
        }
        
        A[Number] = A[i];        
        A[i] = Min;    
    }
}

测试代码：

#include <iostream>

constexpr std::size_t N = 10;

// 声明选择排序
void SELECTION_SORT(int *A, int length);

int main(void)
{    
    int A[N]{ 3, 2, 5, 3, 7, 1, 8, 0, 9, 4 };
    
    SELECTION_SORT(A, N);
    
    for (int a : A)        
        std::cout << a << " ";    
    std::cout << std::endl;
    
    return 0;
}

// 声明选择排序
void SELECTION_SORT(int *A, int length)
{    
    for (int i = 0; i < length; i++)    
    {        
        int Min = A[i];        
        int Number = i;
        
        for (int j = i + 1; j < length; j++)        
        {            
            if (A[j] < Min)            
            {                
                Min = A[j];                
                Number = j;            
            }        
        }
        A[Number] = A[i];        
        A[i] = Min;    
    }
}

/* ——————————————————————————————————————————————————————
 * 输出结果：
 * 0 1 2 3 3 4 5 7 8 9
 * —————————————————————————————————————————————————————— */