计数排序(C++实现)

#include<iostream>
#include<stdlib.h>
using namespace std;
int main() {
	cout << "输入数组长度:";
	int length = 0;
	cin >> length;
	cout << endl;
	cout << "输入数组:";
	int *A = new int[100];
	for (int  i = 0; i < length; i++)
	{
		cin >> A[i];
	}
	int *B = new int[100];
	for (int i = 0; i < length; i++)
	{
		B[i] = 0;
	}
	int *C = new int[100];
	cout << endl;
	cout << "数据采集完毕" << endl;
	for (int i = 0; i < length-1; i++)
	{
		for (int j = i+1; j < length; j++)
		{
			if (A[i] > A[j]) {
				B[i] += 1;
			}else {
				B[j] += 1;
			}
		}
		cout << "第" << i + 1 << "次:";
		for (int j = 0; j < length; j++)
		{
			cout << B[j]<<" ";
		}
		cout << endl;
	}
	for (int i = 0; i < length; i++)
	{
		C[B[i]] = A[i];
	}
	cout << "排序后:";
	for (int i = 0; i < length; i++)
	{
		cout << C[i] << "  ";
	}
	cout << endl;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值