TZC 1283: simple sort - select sort

We use TZC 1283 As an example, briefly explain the sorting （ Including ten classic sorting algorithms ） Of python Implementation method and C Implementation method . During comparison and sorting , Hold down a certain number and compare it with all the following numbers , If the former is greater than the latter , Then exchange , Obviously, there are many times to exchange in the process of comparison and sorting , The ideal way is to press and hold a certain number , Then find the minimum value in all the following numbers, and then compare and Exchange , In this way, the number of exchanges will be reduced .

Original link ：1283: Simple order

---

python The code is as follows ：

#  Selection sort 
def choose_sort(lst):
    for a in range(0, len(lst) - 1):
        p = a
        for b in range(a+1, len(lst)):
            if lst[p] > lst[b]:
                p = b
        if p != a:
            t = lst[p]
            lst[p] = lst[a]
            lst[a] = t


T = int(input())
for i in range(T):
    s = input().split()
    lt = [int(x) for x in s]
    lt1 = lt[::-1]
    lt1.pop()
    n = len(lt1)

    choose_sort(lt1)

    for j in range(n):
        if j != n - 1:
            print(lt1[j], end=' ')
        else:
            print(lt1[j])

C The language code is as follows ：

#include <stdio.h>
void choosesort(int x[],int n)    //  Selection sort  
{
	int i,j,p,temp;
	for(i=0;i<n-1;i++)
	{
		p=i;
		for(j=i+1;j<n;j++)
		{
			if(x[p]>x[j])
			{
				p=j;
			}
		}
		if(p!=i)
		{
			temp=x[p];
			x[p]=x[i];
			x[i]=temp;
		}
	}
}
int main()
{
	int m,n,i,j,a[1000]={0};
	scanf("%d",&m);
	while(m--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
			scanf("%d",&a[i]);
		choosesort(a,n);
		for(i=0;i<n-1;i++)
		   printf("%d ",a[i]);
		printf("%d\n",a[n-1]);
	}
	return 0;
}