Started

ch09-writing-your-own-methods/ask.rb

@@ -1,3 +1,31 @@
 def ask question
-  # your code here
-end
+    while true
+        puts question
+        reply = gets.chomp.downcase
+        if (reply == 'yes' || reply == 'no')
+            if reply == 'yes'
+                return true
+            else
+                return false
+            end
+        else
+            puts 'Please answer "yes" or "no".'
+        end
+    end
+end
+
+puts 'Hello, and thank you for...'
+puts
+ask 'Do you like eating tacos?' 
+ask 'Do you like eating burritos?'
+wets_bed = ask 'Do you wet the bed?'
+ask 'Do you like eating chimichangas?'
+ask 'Do you like eating sopapillas?'
+puts 'Just a few more questions...'
+ask 'Do you like drinking horchata?'
+ask 'Do you like eating flautas?'
+puts
+puts 'DEBRIEFING:'
+puts 'Thank you for...'
+puts
+puts wets_bed

ch09-writing-your-own-methods/old_school_roman_numerals.rb

@@ -1,3 +1,51 @@
 def old_roman_numeral num
-  # your code here
-end
+
+  if num <= 0
+    return '>0 only please!'
+  end
+
+  #this will be our roman numeral string:
+  roman_numeral = ''
+
+  # deal with 1000s
+  thousands = num/1000
+  if thousands > 0
+      roman_numeral = 'M'*thousands
+      num = num - thousands*1000
+  end
+
+  #deal wih 100s
+  hundreds = num/100
+  if hundreds >= 5
+      roman_numeral = roman_numeral + 'D' + 'C'*(hundreds-5)
+  elsif hundreds > 0
+      roman_numeral = roman_numeral + 'C'*hundreds
+  end
+  num = num - hundreds*100
+
+  #deal wih 10s
+  tens = num/10
+  if tens >= 5
+      roman_numeral = roman_numeral + 'L' + 'X'*(tens-5)
+  elsif tens > 0
+      roman_numeral = roman_numeral + 'X'*tens
+  end
+  num = num - tens*10
+
+  #deal wih 1s
+  if num >= 5
+      roman_numeral = roman_numeral + 'V' + 'I'*(num-5)
+  elsif num > 0
+      roman_numeral = roman_numeral + 'I'*num
+  end
+
+  return roman_numeral
+
+end
+
+puts 'Translation:'
+puts '3541 is ' + old_roman_numeral(3541)
+puts '0 is '+ old_roman_numeral(0)
+puts '-123 is ' + old_roman_numeral(-123)
+puts '2077 is ' + old_roman_numeral(2077)
+puts '2005 is ' + old_roman_numeral(2005)

ch09-writing-your-own-methods/roman_numerals.rb

@@ -1,3 +1,61 @@
 def roman_numeral num
-  # your code here
-end
+  if num <= 0
+    return '>0 only please!'
+  end
+
+  #this will be our roman numeral string:
+  roman_numeral = ''
+
+  # deal with 1000s
+  thousands = num/1000
+  if thousands > 0
+      roman_numeral = 'M'*thousands
+      num = num - thousands*1000
+  end
+
+  #deal wih 100s
+  hundreds = num/100
+  if hundreds == 9
+      roman_numeral = roman_numeral + 'CM'
+  elsif hundreds >= 5
+      roman_numeral = roman_numeral + 'D' + 'C'*(hundreds-5)
+  elsif hundreds == 4
+      roman_numeral = roman_numeral + 'CD'
+  elsif hundreds > 0
+      roman_numeral = roman_numeral + 'C'*hundreds
+  end
+  num = num - hundreds*100
+
+  #deal wih 10s
+  tens = num/10
+  if tens == 9
+      roman_numeral = roman_numeral + 'XC'
+  elsif tens >= 5
+      roman_numeral = roman_numeral + 'L' + 'X'*(tens-5)
+  elsif tens == 4
+      roman_numeral = roman_numeral + 'XL'
+  elsif tens > 0
+      roman_numeral = roman_numeral + 'X'*tens
+  end
+  num = num - tens*10
+
+  #deal wih 1s
+  if num == 9
+      roman_numeral = roman_numeral + 'IX'
+  elsif num >= 5
+      roman_numeral = roman_numeral + 'V' + 'I'*(num-5)
+  elsif num == 4
+      roman_numeral = roman_numeral + 'IV'
+  elsif num > 0
+      roman_numeral = roman_numeral + 'I'*num
+  end
+
+  return roman_numeral
+end
+
+puts 'Translation:'
+puts '3541 is ' + roman_numeral(3541)
+puts '0 is '+ roman_numeral(0)
+puts '-123 is ' + roman_numeral(-123)
+puts '2077 is ' + roman_numeral(2077)
+puts '2005 is ' + roman_numeral(2005)

ch10-nothing-new/dictionary_sort.rb

@@ -1,3 +1,31 @@
 def dictionary_sort arr
-  # your code here
-end
+  recursive_sort arr, []
+end
+
+#the method that actually does sorting
+def recursive_sort unsorted_array, sorted_array
+    j = 1
+
+    smallest_index = 0
+
+    until unsorted_array.length == 0
+
+        # find smallest in unsorted_array
+        while j < unsorted_array.length
+            smallest_index = j if unsorted_array[j].to_s.downcase < unsorted_array[smallest_index].to_s.downcase
+            j += 1
+        end
+
+        # move it from the unsorted array to the end of already_sorted
+        sorted_array << unsorted_array[smallest_index]
+        unsorted_array.delete_at(smallest_index)
+
+        # find next smallest with recursive call
+        recursive_sort unsorted_array, sorted_array
+    end
+
+    return sorted_array
+end
+
+puts dictionary_sort ["avada", "Kedavra", "black", "SirIUs", "harry"]
+puts dictionary_sort ["A","feel", "can", "like", "can","singing"]

ch10-nothing-new/english_number.rb

@@ -1,3 +1,109 @@
 def english_number number
-  # your code here
+
+  if number < 0
+    return 'Please enter a number that isn\'t negative.'
+  end
+
+  if number == 0
+    return 'zero'
+  end
+
+  num_string = '' # This is the string we will return.
+
+  ones_place = ['one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine']
+  tens_place = ['ten', 'twenty', 'thirty', 'forty', 'fifty', 'sixty', 'seventy', 'eighty', 'ninety']
+  teenagers = ['eleven', 'twelve', 'thirteen', 'fourteen', 'fifteen', 'sixteen', 'seventeen', 'eighteen', 'nineteen']
+  higher_powers = ['thousand','million', 'billion', 'trillion', 'quadrillion', 'quintillion', 'sextillion', 'septillion', 
+  'octillion', 'nonillion', 'decillion', 'undecillion', 'duodecillion', 'tredecillion', 'quattuordecillion', 'quindecillion',
+  'sedecillion', 'septendecillion', 'octodecillion', 'novendecillion', 'vigintillion']
+
+    # "left" is how much of the number we still have left to write out.
+    # "write" is the part we are writing out right now.
+  left = number
+  write = 0
+
+  #deal with thousands up to vigintillions
+  #start from vigintillion and go down to find the lowest power when write is not 0
+  power = 63
+  i = 20
+
+  until power == 0
+    ten_power = 10**power
+    write = left/ten_power
+    left = left - write*ten_power
+    if write > 0
+      illions = english_number write
+      num_string = num_string + illions + ' ' + higher_powers[i]
+      if left > 0
+        # Add space between thousands and hundreds
+        num_string = num_string + ' '
+      end
+    end
+    power -= 3
+    i -= 1
+  end
+
+  #deal with hundreds
+  write = left/100 # How many hundreds left?
+  left = left - write*100 # Subtract off those hundreds.
+  if write > 0
+     # Now here's the recursion:
+     hundreds = english_number write
+     num_string = num_string + hundreds + ' hundred'
+     if left > 0
+       # So we don't write 'two hundredfifty-one'...
+       num_string = num_string + ' '
+     end
+  end
+
+  #deal with tens
+  write = left/10 
+  left = left - write*10
+  if write > 0
+    #teenagers
+    if ((write == 1) and (left > 0))
+      num_string = num_string + teenagers[left-1]
+      # The "-1" is because teenagers[3] is 'fourteen', not 'thirteen'.
+      left = 0
+    else
+      num_string = num_string + tens_place[write-1]
+      # The "-1" is because tens_place[3] is 'forty', not 'thirty'.
+    end
+    if left > 0
+      # Add space between tens and ones
+      num_string = num_string + '-'
+    end
+  end
+
+  #deal with ones
+  write = left 
+  left = 0
+  if write > 0
+    num_string = num_string + ones_place[write-1]
+    # The "-1" is because ones_place[3] is 'four', not 'three'.
+  end
+
+  # TA DA!
+  num_string
+
 end
+
+
+puts english_number( 0)
+puts english_number( 9)
+puts english_number( 10)
+puts english_number( 11)
+puts english_number( 17)
+puts english_number( 32)
+puts english_number( 88)
+puts english_number( 99)
+puts english_number(100)
+puts english_number(101)
+puts english_number(234)
+puts english_number(3211)
+puts english_number(10000)
+puts english_number(999999)
+puts english_number(1100458)
+puts english_number(1000000000000)
+puts english_number(10**63 + 10**60 + 10**24 + 10*6 + 1215)
+