TZC 1283: simple sort - Comparative 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 . Comparative sorting is the simplest method , The core essence is to press and hold the first one and compare it with all the following , Then press and hold the second one for the second time and compare it with all the others in the back .

Original link ：1283: Simple order

 

---

python The code is as follows ：

#  Compare sort 
def cmp_sort(lst):
    length = len(lst)
    for a in range(0, length - 1):
        for b in range(a + 1, length):
            if lst[a] > lst[b]:
                t = lst[a]
                lst[a] = lst[b]
                lst[b] = 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)

    cmp_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 cmpsort(int x[],int n)
{
	int i,j,temp;
	for(i=0;i<n-1;i++)
	{
		for(j=i+1;j<n;j++)
		{
			if(x[i]>x[j])
			{
				temp=x[i];
				x[i]=x[j];
				x[j]=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]);
		cmpsort(a,n);
		for(i=0;i<n-1;i++)
		   printf("%d ",a[i]);
		printf("%d\n",a[n-1]);
	}
	return 0;
}