FilesExpand file tree

 master

/

count_sort.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

50 lines (35 loc) · 892 Bytes

 master

/

count_sort.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

50 lines (35 loc) · 892 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

#include <iostream>

#define MAXN 10000

using namespace std;

void count_sort(int A[], int N, int K){

int C[MAXN];

int B[MAXN];

memset(C,0,sizeof(C));

for(int i=0; i<N; i++){

C[ A[i] ] ++;

}

for(int i=0; i<K-1; i++){

C[i+1] +=C[i];

}

for(int i=N-1; i>=0; i--){

B[ C[A[i]] - 1 ] = A[i];

C[A[i]]--;

}

for(int i=0; i<N; i++){

cout<<B[i]<<" ";

}cout<<endl;

}

int main(){

//int A[256];

int A[] = {2,5,3,0,2,3,0,3};

int N = 8;

int K = 100;

/*

for(int i=0; i<N; i++){

A[i] = (int) rand()%K;

cout<<A[i]<<endl;

}*/

cout<<"_---------"<<endl;

count_sort(A, N, K);

return 0;

}