<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sunner008的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sunner008</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sunner008]]></copyright><item><title><![CDATA[Analyzing the character of human being]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/100824349</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/100824349</guid><author>sunner008</author><pubDate>Sat, 14 Sep 2019 11:15:44 +0800</pubDate><description><![CDATA[I wanted to analyze a team member when I was a team leader in Shenzhen IBM before. The question is how can I analyze a person using a suitable tool. I came up with the radar map, and I think it is a g...]]></description><category></category></item><item><title><![CDATA[Lecture 11: Testing and debugging]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/78081256</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/78081256</guid><author>sunner008</author><pubDate>Mon, 25 Sep 2017 00:36:42 +0800</pubDate><description><![CDATA[# Lecture 11 fall 2008

def silly():
    res = []
    done = False
    while not done:
        while not done:
            elem = input('Enter element. Return when done. ')
            if elem == '':
]]></description><category></category></item><item><title><![CDATA[Lecture 10: Divide and conquer methods, merge sort, exceptions]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/78081251</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/78081251</guid><author>sunner008</author><pubDate>Mon, 25 Sep 2017 00:35:17 +0800</pubDate><description><![CDATA[# Lecture 10 fall 2008

def merge(left,right):
    result = []
    i,j = 0, 0
    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            result.append(left[i])
           ]]></description><category></category></item><item><title><![CDATA[Lecture 9: Binary search, bubble and selection sorts]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/78081223</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/78081223</guid><author>sunner008</author><pubDate>Mon, 25 Sep 2017 00:25:31 +0800</pubDate><description><![CDATA[# Lecture 9 fall 2008

def bsearch(s, e, first, last, calls):
    print (first, last, calls)
    if (last - first) < 2:
        return s[first] == e or s[last] == e
    mid = first + (last - first)//2]]></description><category></category></item><item><title><![CDATA[Lecture 8: Complexity; log, linear, quadratic, exponential algorithms]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/78081220</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/78081220</guid><author>sunner008</author><pubDate>Mon, 25 Sep 2017 00:24:07 +0800</pubDate><description><![CDATA[# code file for lecture 8, 2008 fall


#interative exponent
def exp1(a,b):
    ans = 1# Initiation ans(two more step)
    while (b>0):#Step1: comparsion
        ans *= a#Step2: multiplication
        ]]></description><category></category></item><item><title><![CDATA[Lecture 7_2: Lists and mutability, dictionaries, pseudocode, introduction to efficiency]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/78081208</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/78081208</guid><author>sunner008</author><pubDate>Mon, 25 Sep 2017 00:21:14 +0800</pubDate><description><![CDATA[# example code, Lecture 7, Fall 2008

import math

#get base
inputOK = False
while not inputOK:
    base = float(input('Enter base:'))
    #we get str in python 3x from input, we need to convert str t]]></description><category></category></item><item><title><![CDATA[Lecture 7_1: Lists and mutability, dictionaries, pseudocode, introduction to efficiency]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/78081192</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/78081192</guid><author>sunner008</author><pubDate>Mon, 25 Sep 2017 00:17:34 +0800</pubDate><description><![CDATA[# example code, Lecture 7, Fall 2008

def showDicts():
    EtoF = {'one': 'un', 'soccer': 'football', 'never': 'janaie'}
    print (EtoF['soccer'])
    input()
#    print (EtoF[0])
    #Dictionary is]]></description><category></category></item><item><title><![CDATA[Lecture 6: Bisection methods, Newton/Raphson, introduction to lists]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/78081187</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/78081187</guid><author>sunner008</author><pubDate>Mon, 25 Sep 2017 00:16:14 +0800</pubDate><description><![CDATA[# example code, Lecture 6, Fall 2008

s = 0
for i in range(10):
  s += 0.1
print (s)

def squareRootBi(x,epsilon):
    '''Assumes x >= 0 and epsilon > 0
        return y s.t. y*y is within epsilon of]]></description><category></category></item><item><title><![CDATA[Lecture 4: Decomposition and abstraction through functions; introduction to recursion]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/78081183</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/78081183</guid><author>sunner008</author><pubDate>Mon, 25 Sep 2017 00:14:37 +0800</pubDate><description><![CDATA[# example code, Lecture 4, Fall 2008

def sqrt(x):
    ans = 0
    if x >= 0:
        while ans*ans < x: ans = ans + 1
        if ans*ans != x:
            print (x, 'if not a prefect square')
       ]]></description><category></category></item><item><title><![CDATA[Lecture 3: Common code patterns: iterative programs]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/78081173</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/78081173</guid><author>sunner008</author><pubDate>Mon, 25 Sep 2017 00:12:35 +0800</pubDate><description><![CDATA[# example code, Lecture 3, Fall 2008

x =16
ans = 0
while ans*ans < x:
    ans = ans + 1
print (ans)

x = 1515361
ans = 0
if x >= 0:
    while ans*ans < x:
        ans = ans + 1
        print ('ans =']]></description><category></category></item><item><title><![CDATA[Lecture 2: Operators and operands; statements; branching, conditionals, and iteration]]></title><link>https://blog.youkuaiyun.com/sunner008/article/details/78081145</link><guid>https://blog.youkuaiyun.com/sunner008/article/details/78081145</guid><author>sunner008</author><pubDate>Mon, 25 Sep 2017 00:06:04 +0800</pubDate><description><![CDATA[# sample code for use in Lecture 2, Fall 2008

x = 3
x=x*x
n = input('Enter a number:')
print (n)

x = 15
if (x/2)*2 == x:
    print ('even')
else: print ('odd')

z = 'b'
if 'x'<z:
    print ('Hello')]]></description><category></category></item></channel></rss>