【跟着MIT学Python】Unit 2.3 Simple Algorithms

REVIEW

Strings

s = 'abcdefg'
s[::-1] = ‘gfedcba’

strings are immutable type, can not be modified. [CANNOT assign a number to a piece of a string]

For loop

for char in s:
	if char == 'i' or char =='o':
		print('There is a i or o') 

APPROXIMATE SOLUTIONS

BISCTION SEARCH

Pick a value in the middle first.

x =25
epsilon = 0.01
numGuesses = 0
low = 0
high = x
ans = (low + high)/2

while (ans**2 - x) >= epsilon

Floats and Fractions

• Decimal number:

302 = 310^2+0*101+210^0

• Binary number:

10011 = 12^4+0*23+02^2+1*21+1*2^0

Convert decimal integer to binary

if num < 0:
	isNeg = True
	num = abs(num)
else:
	isNeg = False
result = ' '
if num == 0
result = '0'
while num>0:
	result = str(num%2) + result
	num = num//2
if(isNeg):
	result = '-' + 'result'

Fractions

3/8 = 0.375 = 3E-3+7E-2+5E-3

• Convert de fraction into the decimal

0.375*(2**3) = 3 (which is decimal)

• Convert decimal to binary

3→11

• Divide by 2**3(shift left) to get 0.011(binary)

NEWTON-PRPHSON

• General approximation algorithm to find roots of a polynomial in one variable

$$p(x)=a_n{x}^n+a_{n-1}{x}^{n-1}+...+a_{1}x+a_0$$

• Want to find r such that p® = 0
• Newton showed that if g is an approx. to the root, then

$$g-p(g)/p^{\prime }(g)$$

is a better approx.