FilesExpand file tree

 master

/

Deck.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

119 lines (102 loc) · 2.38 KB

 master

/

Deck.java

Copy path

Top

File metadata and controls

• Code
• Blame

119 lines (102 loc) · 2.38 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

import java.util.Arrays;

import java.util.Random;

/**

* A deck of playing cards (of fixed size).

*/

public class Deck {

private Card[] cards;

/**

* Constructs a standard deck of 52 cards.

*/

public Deck() {

this.cards = new Card[52];

int index = 0;

for (int suit = 0; suit <= 3; suit++) {

for (int rank = 1; rank <= 13; rank++) {

this.cards[index] = new Card(rank, suit);

index++;

}

}

}

/**

* Constructs a deck of n cards (null).

*/

public Deck(int n) {

this.cards = new Card[n];

}

/**

* Gets the internal cards array.

*/

public Card[] getCards() {

return this.cards;

}

/**

* Displays each of the cards in the deck.

*/

public void print() {

for (int i = 0; i < this.cards.length; i++) {

System.out.println(this.cards[i]);

}

}

/**

* Returns a string representation of the deck.

*/

public String toString() {

return Arrays.toString(this.cards);

}

/**

* Chooses a random number between low and high, including both.

*/

public int randomInt(int low, int high) {

return 0;

}

/**

* Swaps the cards at indexes i and j.

*/

public void swapCards(int i, int j) {

}

/**

* Randomly permutes the array of cards.

*/

public void shuffle() {

}

/**

* Finds the index of the lowest card

* between low and high inclusive.

*/

public int indexLowest(int low, int high) {

return 0;

}

/**

* Sorts the cards (in place) using selection sort.

*/

public void selectionSort() {

}

/**

* Returns a subset of the cards in the deck.

*/

public Deck subdeck(int low, int high) {

Deck sub = new Deck(high - low + 1);

for (int i = 0; i < sub.cards.length; i++) {

sub.cards[i] = this.cards[low + i];

}

return sub;

}

/**

* Combines two previously sorted subdecks.

*/

public static Deck merge(Deck d1, Deck d2) {

return null;

}

/**

* Returns a sorted copy of the deck using merge sort.

*/

public Deck mergeSort() {

return this;

}

/**

* Reorders the cards (in place) using insertion sort.

*/

public void insertionSort() {

}

}