infile.txt
and creates an acronym from the first letter of each line. For example, if the input file is:Thank
Goodness
It's
Friday
Your program will create and print out the string "TGIF"
L=[["cat", "mammal"], ["boa", "reptile"], ["dove", "bird"], ["dog", "mammal"]]
Show the value and type of each expression given below:
VALUE TYPE
----- ----
len(L)
L[1]
L[1][0]
L[0][1] == L[3][1]
L[0][1] + "-" + L[0][0]
for i in range(2):
for j in range (3):
print("i:%d j:%d" % (i,j))
How many steps would it take to do binary search on a list of size 1 million when the item you are searching for is NOT in the list?
How many steps would it take to do linear search on a list of size 1 million when the item you are searching for is NOT in the list?
Binary search is much faster than linear search, so why don't we use it for every search problem?
For each iteration of the loop in binarySearch(x, L)
, show the index values for low, high, and mid, and the value stored at location mid. What will be returned by this function call?
x = 67
L = [10, 12, 14, 21, 37, 44, 45, 46, 58, 67, 99]
0 1 2 3 4 5 6 7 8 9 10
low | high | mid | L[mid]
-------------------------
| | |
| | |
| | |
| | |
binarySearch(y, L)
, show the index values for low, high, and mid, and the value stored at location mid. What will be returned by this function call?y = 4
L = [10, 12, 14, 21, 37, 44, 45, 46, 58, 67, 99]
0 1 2 3 4 5 6 7 8 9 10
low | high | mid | L[mid]
-------------------------
| | |
| | |
| | |
| | |
def indexOfSmallest(ls):
"""
Inputs: A list of values
Returns: The index of the smallest item in the list, -1 if the list
is empty
Purpose: To find the location of the smallest item in the given list
"""
# complete this function
for i in range(N):
for j in range(N):
print(i, j)
while N > 1:
print(N)
N = N//2
for i in range(N):
for j in range(10):
print(i*j)
Which algorithm requires time directly proportional to the size of the input list?