Data Structure & Question "5"

Luogu Sorting Algorithm Question List: https://www.luogu.com.cn/training/107#problems

P1271 [Shen Ji 9. Example 1] Election Student Union

Bubble sort, over time!

#include<stdio.h>
#define MAXN  2000000

int num[MAXN];

int main(){
	int a,b,temp;
	scanf("%d%d",&a,&b);
	for(int i=0;i<b;i++)
		scanf("%d",&num[i]);
	for(int j=0;j<b;j++){
		for(int k=0;k<b-1;k++){
			if(num[k]>num[k+1]){
				temp = num[k];
				num[k] = num[k+1];
				num[k+1] = temp;
			}
		}
	}
	for(int i=0;i<b;i++){
		printf("%d ",num[i]);
	}
	return 0;
} 

Count sort

#include<stdio.h>

int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	int a[n+1]={0},num[m],temp[m];
	for(int i=0;i<m;i++)
		scanf("%d",&num[i]);
	// 计算每个元素的个数放入数组a中 
	for(int j=0;j<m;j++)
		a[num[j]]++;
	
	// 依次累加
	for(int k=1;k<=n;++k)
		a[k] = a[k-1]+a[k];
	// 排序
	for(int i=m-1;i>=0;--i){
		int index = a[num[i]]-1;
		temp[index] = num[i];
		a[num[i]]--;
	} 
	for(int i=0;i<m;i++){
		printf("%d ",temp[i]);
	}
	return 0;
}

P1177 [Template] Quick Sort