var cards = new Array("ace","king","queen","jack",10,9,8,7,6,5,4,3,2);
var hand = [];

function dealHand(numberOfCards){
	//if numberOfCards is greater than zero
	if(numberOfCards > 0){
		// Store a random number
		var n = Math.floor(Math.random() * cards.length);
		// Add card to the hand array
		hand.push(cards[n]);
		// Output the card
		console.log("Your card is " + cards[n]);
		// remove card selected from cards array
		cards.splice([n],1);
		// remove from numberOfCards
		numberOfCards--;
		// recursive function call 
		dealHand(numberOfCards);
	}	
}

function goFish(num, guess){
	// if num is greater than zero
	if(num >= 0){
		if(hand[num]===guess){
			console.log("A Match for", hand[num]);
			return;
		} else if (num === 0){
			console.log("Go Fish: No matches for " + guess);
		}
		// remove from num
		num--;
	  // recursive function call... remember to use both arguments
	  goFish(num, guess);
	}
}
// Call dealHand and goFish
dealHand(5);
goFish(cards.length, 3);

var change = 0;
function howManyQuarters(howMuchMoney) {
    //fill this in
    if (howMuchMoney < 0.25){
    	change = howMuchMoney;
    	return 0;
   	} else {
   		return 1 + howManyQuarters(howMuchMoney - 0.25);
   	}
}
change = 0.99;
console.log ("Pay out " + howManyQuarters(change) + " quarters");
console.log ("And you'll have " + change * 100 + " pennies left over"); 

function factorial(n) {
  // Termination condition to prevent infinite recursion
  if (n < 0) {
    console.log("Can't make a factorial from a negative number.");
    return;
  }
  // Base case
  if (n === 0) {
    return 1;
  }
  // What's wrong with this picture? Why won't this recursion work?
  return n * factorial(n - 1);
}

factorial(5);

1.factorial(3) {
	return 3 * factorial(2);
2.	factorial(2) {
		return 2 * factorial(1);
3.		factorial(1) {
			return 1 * factorial(0);
4.			factorial(0) {
A=				return 1;
			};
5.		factorial(1) {
B=      		return 1; // 1 * 1
     	};
6.	factorial(2) {
C=		return 2; // 2 * 1
   };
7.factorial(3) {
D=	return 6; // 3 * 2
};

var stack = [];

function countDown(int) {
  stack.push(int);
  if (int === 1) {	
    return 1;
  }
    return countDown(int - 1);
}
// [7, 6, 5, 4, 3, 2, 1]

// ここまでは大丈夫。

function multiplyEach() {
  // Remove the last value of the stack 
  // and assign it to the variable int
  int = stack.pop();
  x = stack.length;
  // Base case
  if (x === 0) {
    return int;
  }

  // ここまでも大丈夫。でも以下の Recursive case に何書けばいいのかわかんなかった。

  // Recursive case
  else {
	return int * multiplyEach();
  }
}

// Call the function countDown(7)
countDown(7);
// And then print out the value returned by multiplyEach()
console.log(multiplyEach());