Created
December 21, 2011 03:29
-
-
Save AnimaWish/1504427 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# This function will break up words for us. | |
def break_words(stuff) | |
words = stuff.split(' ') | |
return words | |
end | |
# Sorts the words. | |
def sort_words(words) | |
words.sort() | |
#return sorted(words) | |
end | |
# Prints the first word after popping it off. | |
def puts_first_word(words) | |
word = words.shift() | |
puts word | |
end | |
# Prints the last word after popping it off. | |
def puts_last_word(words) | |
word = words.pop() | |
puts word | |
end | |
# Takes in a full sentence and returns the sorted words. | |
def sort_sentence(sentence) | |
words = break_words(sentence) | |
return sort_words(words) | |
end | |
# Puts the first and last words of the sentence. | |
def puts_first_and_last(sentence) | |
words = break_words(sentence) | |
puts_first_word(words) | |
puts_last_word(words) | |
end | |
# Sorts the words then prints the first and last one. | |
def puts_first_and_last_sorted(sentence) | |
words = sort_sentence(sentence) | |
puts_first_word(words) | |
puts_last_word(words) | |
end | |
puts "Let's practice everything." | |
puts 'You\'d need to know \'bout escapes with \\ that do \n newlines and \t tabs.' | |
poem = <<POEM | |
\tThe lovely world | |
with logic so firmly planted | |
cannot discern \n the needs of love | |
nor comprehend passion from intuition | |
and requires an explanation | |
\n\t\twhere there is none. | |
POEM | |
puts "--------------" | |
puts poem | |
puts "--------------" | |
five = 10 - 3 + 3 - 5 | |
puts "This should be five: %s" % five | |
def secret_formula(started) | |
jelly_beans = started * 500 | |
jars = jelly_beans / 1000 | |
crates = jars / 100 | |
return jelly_beans, jars, crates | |
end | |
start_point = 10000 | |
beans, jars, crates = secret_formula(start_point) | |
puts "With a starting point of: %d" % start_point | |
puts "We'd have %d beans, %d jars, and %d crates." % [beans, jars, crates] | |
start_point = start_point / 10 | |
puts "We can also do that this way:" | |
puts "We'd have %d beans, %d jars, and %d crates." % secret_formula(start_point) | |
sentence = "All good things come to those who wait." | |
words = break_words(sentence) | |
sorted_words = sort_words(words) | |
puts_first_word(words) | |
puts_last_word(words) | |
puts_first_word(sorted_words) | |
puts_last_word(sorted_words) | |
sorted_words = sort_sentence(sentence) | |
print sort_words(words) | |
puts_first_and_last(sentence) | |
puts_first_and_last_sorted(sentence) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment