lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Resolve Issue #40: Python 2 print statements changed to use Python 3 print function (#50)

Browse Source 
* Update 01_selection_sort.py

Updated last print statement for Python 3 print function.

* Update 01_countdown.py

Updated print statement to print function for Python 3.

* Update 05_quicksort.py

Updated print statement to print function for Python 3.

* Update 01_price_of_groceries.py

Condensed dictionary creation into one line, edited print statement to a print function for Python 3.

* Update 01_set_covering.py

Changed print statement to print function for Python 3.

* Update 01_binary_search.py

Changed print statements to print function for Python 3.
This commit is contained in:
Danh Nguyen
2018-02-03 11:15:07 -08:00
committed by Aditya Bhargava
parent a010e5c715
commit 1fa164c40e
6 changed files with 8 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
01_introduction_to_algorithms/python/01_binary_search.py
View File

@@ -22,7 +22,7 @@ def binary_search(list, item):
return None return None
my_list = [1, 3, 5, 7, 9] my_list = [1, 3, 5, 7, 9]
print binary_search(my_list, 3) # => 1 print(binary_search(my_list, 3)) # => 1
# 'None' means nil in Python. We use to indicate that the item wasn't found. # 'None' means nil in Python. We use to indicate that the item wasn't found.
print binary_search(my_list, -1) # => None print(binary_search(my_list, -1)) # => None

2
02_selection_sort/python/01_selection_sort.py
View File

@@ -19,4 +19,4 @@ def selectionSort(arr):
newArr.append(arr.pop(smallest)) newArr.append(arr.pop(smallest))
return newArr return newArr
print selectionSort([5, 3, 6, 2, 10]) print(selectionSort([5, 3, 6, 2, 10]))

2
03_recursion/python/01_countdown.py
View File

@@ -1,5 +1,5 @@
def countdown(i): def countdown(i):
print i print(i)
# base case # base case
if i <= 0: if i <= 0:
return return

2
04_quicksort/python/05_quicksort.py
View File

@@ -11,4 +11,4 @@ def quicksort(array):
greater = [i for i in array[1:] if i > pivot] greater = [i for i in array[1:] if i > pivot]
return quicksort(less) + [pivot] + quicksort(greater) return quicksort(less) + [pivot] + quicksort(greater)
print quicksort([10, 5, 2, 3]) print(quicksort([10, 5, 2, 3]))

9
05_hash_tables/python/01_price_of_groceries.py
View File

@@ -1,7 +1,2 @@
book = dict() book = {"apple": 0.67, "milk": 1.49, "avocado": 1.49}
# an apple costs 67 cents print(book)
book["apple"] = 0.67
# milk costs $1.49
book["milk"] = 1.49
book["avocado"] = 1.49
print book

2
08_greedy_algorithms/python/01_set_covering.py
View File

@@ -22,4 +22,4 @@ while states_needed:
states_needed -= states_covered states_needed -= states_covered
final_stations.add(best_station) final_stations.add(best_station)
print final_stations print(final_stations)