Advertisement
Guest User

Untitled

a guest
Apr 30th, 2017
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.46 KB | None | 0 0
  1. package week09;
  2. import java.util.Random;
  3.  
  4. public class OverhandShuffler{
  5.  
  6. private static Random R = new Random();
  7.  
  8. public static void main(String[] args){
  9. int test = Integer.parseInt(args[0]);
  10. makeNew(test);
  11. int [] deck = new int [test];
  12. for(int i=0; i<deck.length; i++){
  13. deck[i] = i;
  14. }
  15. shuffle(deck);
  16. }
  17.  
  18.  
  19. public static void makeNew(int size){
  20. int[] deck = new int[size];
  21. for(int i=0; i<size; i++){
  22. deck[i] = i;
  23. }
  24. }
  25.  
  26. public static void shuffle(int[] blocks){
  27. int [] shuffledDeck = new int[blocks.length];
  28. int counter = 0;
  29. int remainder = blocks.length;
  30. int random;
  31. while(counter != blocks.length){
  32. random = R.nextInt(remainder);
  33. //System.out.println("random: " + random);
  34. for(int i = random; i<remainder; i++){
  35. shuffledDeck[counter] = blocks[i];
  36. System.out.println("deck value: " + shuffledDeck[counter] + " position: " + counter);
  37. counter++;
  38. }
  39. remainder = random;
  40. }
  41. }
  42.  
  43. public static int unbrokenPairs(){
  44.  
  45. int originalPairs = deck.length;
  46. int count = 0;
  47. int[] currentDeck = getCurrent();
  48. for (int i = 1; i < deck.length; i++){
  49. if(deck[i-1]+1 == deck[i]){
  50. count++;
  51. }
  52. }
  53.  
  54. return count;
  55. }
  56.  
  57. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement