counting sort(stable)
来源:互联网 发布:python http服务端框架 编辑:程序博客网 时间:2024/04/30 14:41
#include<stdio.h>
#include<malloc.h>
void counting_sort(int a[], int sorted[],int k,int size)
{
int *c=(int *)malloc((k+1)*sizeof(int));
int i=0;
for(;i<k+1;i++)
c[i]=0;
for(i=0;i<size;i++)
c[a[i]]=c[a[i]]+1;
//now,c[i] contains the numbers of elements equals to i
for(i=1;i<k+1;i++)
c[i]=c[i]+c[i-1];
//now ,c[i] contains the numbers of elements equals or less than i
for(i=size-1;i>-1;i--)
{
sorted[c[a[i]]-1]=a[i];
c[a[i]]=c[a[i]]-1;
}
free(c);
}
int main()
{
int a[10]={9,5,2,6,7,1,0,3,8,4};
int b[10]={-1};
counting_sort(a,b,9,10);
int i=0;
for(;i<10;i++)
printf("%d ",b[i]);
printf("/n");
return 0;
}
#include<malloc.h>
void counting_sort(int a[], int sorted[],int k,int size)
{
int *c=(int *)malloc((k+1)*sizeof(int));
int i=0;
for(;i<k+1;i++)
c[i]=0;
for(i=0;i<size;i++)
c[a[i]]=c[a[i]]+1;
//now,c[i] contains the numbers of elements equals to i
for(i=1;i<k+1;i++)
c[i]=c[i]+c[i-1];
//now ,c[i] contains the numbers of elements equals or less than i
for(i=size-1;i>-1;i--)
{
sorted[c[a[i]]-1]=a[i];
c[a[i]]=c[a[i]]-1;
}
free(c);
}
int main()
{
int a[10]={9,5,2,6,7,1,0,3,8,4};
int b[10]={-1};
counting_sort(a,b,9,10);
int i=0;
for(;i<10;i++)
printf("%d ",b[i]);
printf("/n");
return 0;
}
- counting sort(stable)
- Counting sort
- Counting sort
- Counting sort
- counting sort
- Counting sort
- Counting Sort
- Counting Sort
- counting-sort
- 稳定排序_ALDS1_2_C:Stable Sort
- counting sort和radix sort
- 【算法实现】counting sort
- In-place Counting Sort
- 计数排序(Counting-Sort)
- 计数排序:counting-sort
- 计数排序(Counting Sort)
- Foundation: Comparison Counting Sort
- Foundation: Distribution Counting Sort
- 如何重启X?
- Google优化之搜索结果优化篇
- 用实例把OO的JavaScript说明白
- 破广播修好了
- 新企业网站的Google排名策略
- counting sort(stable)
- 常用linux命令
- OEMAddressTable介绍
- 压缩和解压缩的类
- 命令行刷新本地DNS
- 中国互连网缺少伯乐!
- varchar是按字节存储的.而带"n"的nvarchar是按字符存储的
- 关键是你的心里要有阳光
- 十大Google Earth可以做的事