FilesExpand file tree

 DSA

/

bucketSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

179 lines (116 loc) · 3.9 KB

 DSA

/

bucketSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

179 lines (116 loc) · 3.9 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

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

import java.util.Arrays;

import java.util.Collections;

import java.util.Vector;

public class bucketSort {

static void bucketSort(float[] arr , int n){

if (n<=0){

return;

}

@SuppressWarnings("unchecked")

Vector<Float> [] buckets = new Vector [n];

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

buckets[i] = new Vector <Float> ();

}

for (int j = 0; j < n; j++) {

float idx = arr[j] * n ;

buckets [(int) idx].add(arr[j]);

}

for (int k = 0; k <n; k++) {

Collections.sort(buckets[k]);

}

int index = 0 ;

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

for (int j = 0; j < buckets[i].size() ; j++) {

arr[index++] = buckets[i].get(j);

}

}

}

public static void main(String[] args) {

float arr[] = { (float)0.897, (float)0.565,

(float)0.656, (float)0.1234,

(float)0.665, (float)0.3434 };

int n = arr.length ;

bucketSort(arr , n);

for (float f : arr) {

System.out.print(f + " ");

}

}

}

// class GFG {

// // Function to sort arr[] of size n

// // using bucket sort

// static void bucketSort(float arr[], int n)

// {

// if (n <= 0)

// return;

// // 1) Create n empty buckets

// @SuppressWarnings("unchecked")

// Vector<Float>[] buckets = new Vector[n];

// for (int i = 0; i < n; i++) {

// buckets[i] = new Vector<Float>();

// }

// // 2) Put array elements in different buckets

// for (int i = 0; i < n; i++) {

// float idx = arr[i] * n;

// buckets[(int)idx].add(arr[i]);

// }

// // 3) Sort individual buckets

// for (int i = 0; i < n; i++) {

// Collections.sort(buckets[i]);

// }

// // 4) Concatenate all buckets into arr[]

// int index = 0;

// for (int i = 0; i < n; i++) {

// for (int j = 0; j < buckets[i].size(); j++) {

// arr[index++] = buckets[i].get(j);

// }

// }

// }

// // Driver code

// public static void main(String args[])

// {

// float arr[] = { (float)0.897, (float)0.565,

// (float)0.656, (float)0.1234,

// (float)0.665, (float)0.3434 };

// int n = arr.length;

// bucketSort(arr, n);

// System.out.println("Sorted array is ");

// for (float el : arr) {

// System.out.print(el + " ");

// }

// }

// }

class Solution {

int [] [] memo ;

int MOD = (int) 1e9 + 7 ;

int arrLen;

public int dp (int curr , int remain){

if (remain==0){

if (curr==0){

return 1 ;

}

return 0 ;

}

if (memo[curr][remain] != -1){

return memo[curr][remain];

}

int ans = dp (curr , remain+1);

if (curr>0){

ans = (ans + dp(curr-1 , remain-1)) % MOD;

}

if (curr < arrLen -1){

ans = (ans + dp(curr+1 , remain-1)) % MOD;

}

memo [curr][remain] = ans ;

return ans ;

}

public int numWays(int arrLen , int steps){

arrLen = Math.min(arrLen , steps);

this.arrLen = arrLen ;

memo = new int [arrLen][steps+1];

for (int [] row : memo){

Arrays.fill(row , -1);

}

return dp(0 , steps) ;

}

}