-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
3 changed files
with
158 additions
and
0 deletions.
There are no files selected for viewing
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,36 @@ | ||
print "Let's practice everything." | ||
print 'You\'d need to know \'bout escapes with \\ that do \n newlines and \t tabs.' | ||
|
||
poem = """ | ||
\tThe lovely world | ||
with logic so firmly planted | ||
cannot discern \n the needs of love | ||
nor comprehend passion from intuition | ||
and requires and explanation | ||
\n\t\twhere there is none. | ||
""" | ||
|
||
print "_________________" | ||
print poem | ||
print "_________________" | ||
|
||
five = 10 - 2 + 3 - 6 | ||
print "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 | ||
|
||
start_point = 10000 | ||
beans, jars, crates = secret_formula(start_point) | ||
|
||
print "With a stratign point of: %d" % start_point | ||
print "We'd have %d beans, %d jars, and %d crates." % (beans, jars, crates) | ||
|
||
start_point /= 10 | ||
|
||
print "We can also do that this way:" | ||
print "We'd have %d beans, %d jars, and %d crates." % secret_formula(start_point) | ||
|
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,31 @@ | ||
def break_words(stuff): | ||
"""This function will break up words for us.""" | ||
words = stuff.split(' ') | ||
return words | ||
|
||
def sort_words(words): | ||
return sorted(words) | ||
|
||
def print_first_word(words): | ||
word = words.pop(0) | ||
print word | ||
|
||
def print_last_word(words): | ||
word = words.pop(-1) | ||
print word | ||
|
||
def sort_sentence(sentence): | ||
words = break_words(sentence) | ||
return sort_words(words) | ||
|
||
def print_first_and_last(sentence): | ||
words = break_words(sentence) | ||
print_first_word(words) | ||
print_last_word(words) | ||
|
||
def print_first_and_last_sorted(sentence): | ||
words = sort_sentence(sentence) | ||
print_first_word(words) | ||
print_last_word(words) | ||
|
||
|
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,91 @@ | ||
def break_words(stuff): | ||
"""This function will break up words for us.""" | ||
words = stuff.split(' ') | ||
return words | ||
|
||
def sort_words(words): | ||
"""Sorts the words.""" | ||
return sorted(words) | ||
|
||
def print_first_word(words): | ||
"""Prints the first word after popping it off.""" | ||
word = words.pop(0) | ||
print word | ||
|
||
def print_last_word(words): | ||
"""Prints the last word after popping it off.""" | ||
word = words.pop(-1) | ||
print word | ||
|
||
def sort_sentence(sentence): | ||
"""Takes in a full sentence and returns the sorted words.""" | ||
words = break_words(sentence) | ||
return sort_words(words) | ||
|
||
def print_first_and_last(sentence): | ||
"""Prints the first and last words of the sentence.""" | ||
words = break_words(sentence) | ||
print_first_word(words) | ||
print_last_word(words) | ||
|
||
def print_first_and_last_sorted(sentence): | ||
"""Sorts the words then prints the first and last one.""" | ||
words = sort_sentence(sentence) | ||
print_first_word(words) | ||
print_last_word(words) | ||
|
||
|
||
print "Let's practice everything." | ||
print 'You\'d need to know \'bout escapes with \\ that do \n newlines and \t tabs.' | ||
|
||
poem = """ | ||
\tThe lovely world | ||
with logic so firmly planted | ||
cannot discern \n the needs of love | ||
nor comprehend passion from intuition | ||
and requires an explantion | ||
\n\t\twhere there is none. | ||
""" | ||
|
||
|
||
print "--------------" | ||
print poem | ||
print "--------------" | ||
|
||
five = 10 - 2 + 3 - 5 | ||
print "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 | ||
|
||
|
||
start_point = 10000 | ||
beans, jars, crates = secret_formula(start_point) | ||
|
||
print "With a starting point of: %d" % start_point | ||
print "We'd have %d jeans, %d jars, and %d crates." % (beans, jars, crates) | ||
|
||
start_point = start_point / 10 | ||
|
||
print "We can also do that this way:" | ||
print "We'd have %d beans, %d jars, and %d crabapples." % secret_formula(start_point) | ||
|
||
|
||
sentence = "All god\tthings come to those who weight." | ||
|
||
words = break_words(sentence) | ||
sorted_words = sort_words(words) | ||
|
||
print_first_word(words) | ||
print_last_word(words) | ||
print_first_word(sorted_words) | ||
print_last_word(sorted_words) | ||
sorted_words = sort_sentence(sentence) | ||
print sorted_words | ||
|
||
print_first_and_last(sentence) | ||
|
||
print_first_and_last_sorted(sentence) |