FilesExpand file tree

 master

/

RadixSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

99 lines (57 loc) · 2.17 KB

 master

/

RadixSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

99 lines (57 loc) · 2.17 KB

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

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

import java.util.Arrays;

public class RadixSort {

String complexity;

RadixSort() {

complexity = ". O(w dot n) Time Complexity.";

}

void sort(int[] sortArray) {

/*

Begin Time Start

*/

double start = (double) System.nanoTime();

final int INITIAL_RADIX = 10;

sort(sortArray, INITIAL_RADIX);

/*

End Time

*/

double end = (double) System.nanoTime();

System.out.println("RadixSort: " + Arrays.toString(sortArray) + complexity + " Seconds taken was " + ((end - start) / 1000000));

}

void sort(int[] sortArray, int column) {

// Grab the start and finish of the array so we can match the range

int min = sortArray[0];

int max = sortArray[0];

for (int count = 1; count < sortArray.length; count++) {

if (sortArray[count] < min) {

min = sortArray[count];

}

else if (sortArray[count] > max) {

max = sortArray[count];

}

}

int digit = 1;

while ((max - min) / digit >= 1) {

columnCompare(sortArray, column, digit, min);

digit *= column;

}

}

void columnCompare(int[] sortArray, int column, int digit, int min) {

int index;

int[] buckets = new int[column];

int[] tempArray = new int[sortArray.length];

for (int count = 0; count < sortArray.length; count++) {

index = (int) (((sortArray[count] - min) / digit) % column); // Grab specific column using modulo

buckets[index]++;

}

for (int count = 1; count < column; count++) {

buckets[count] += buckets[count - 1];

}

for (int count = sortArray.length - 1; count >= 0; count--) {

index = (int) (((sortArray[count] - min) / digit) % column);

tempArray[--buckets[index]] = sortArray[count];

}

for (int count = 0; count < sortArray.length; count++) {

sortArray[count] = tempArray[count];

}

}

}