kenrett

def count_between(array, lower_bound, upper_bound)
  if array.empty?
		return 0
	end
	
	array.each do |num| 
		if num >= lower_bound && num <= upper_bound
			return num
		else
			return 0

kenrett

def count_between(array, lower_bound, upper_bound)
  if array.empty?
		return 0
	end
	
	counter = 0
	array.select { |num| counter += 1 if num >= lower_bound && num <= upper_bound }  
	end
	counter

kenrett

Exercise: Calculating the array mode
Write a method mode which takes an Array of numbers as its input and returns an Array of the most frequent values.

If there's only one most-frequent value, it returns a single-element Array.

For example,

mode([1,2,3,3])         # => [3]
mode([4.5, 0, 0])       # => [0]
mode([1.5, -1, 1, 1.5]) # => [1.5]

kenrett

def times_table(rows)
  if rows == 0
		return false
	end
	array = []
	counter = 1
	while counter <= rows
		1.upto(rows) do |i| 
			array << i*counter
		end

kenrett

def factorial(n)
  if n == 0
		return 1
	end
	counter = 0
	array = []
	while n >= counter
		n.times do |i|
			array << i *= (n-counter)
		end

kenrett

def mode(array)
  a = array.inject(Hash.new(0)) { |key, value| key[value] += 1; key }
	array.sort_by { |value| a[value] }.last
end

kenrett

class GuessingGame
	def initialize(answer)
		@answer = answer
	end

	def guess(g)
		@guess = g
		if @answer < @guess
			return :high
		end

kenrett

Instructions:

1. Download this application skeleton.
2. Convert the app to use AJAX.
3. Add any files you changed to your gist and submit your code.

kenrett

Instructions:

1. Download this application skeleton.
2. Convert the app to use AJAX.
3. Add any files you changed to your gist and submit your code.
5. https://github.com/kenrett/luckyajax.git

kenrett

/* Here is your chance to take over Socrates!  


Spend 10 minutes on each of the following hacks to the socrates website.
Enter them in the console to make sure it works and then save
your results here. 

Choose a new pair for each. Add your names to the section you complete.
*/