人よ、幸福に生きよ

1
def sequentialSearch(alist,item):
2
    pos = 0
3
    found = False
4

5
    while pos < len(alist) and not found:
6
        if alist[pos] == item:
7
            found = True
8
        else:
9
            pos = pos + 1
10
    return found

1
def orderedSequentialSearch(alist,item):
2
    pos = 0
3
    found = False
4
    stop = False
5

6
    while pos < len(alist) and not found and not stop:
7
        if alist[pos] == item:
8
            found = True
9
        else:
10
            if alist[pos] > item:
11
                stop = True
12
            else:
13
                pos = pos + 1
14
    return found

1
def binarySearch(alist,item):
2
    first = 0
3
    last = len(alist) - 1
4
    found = False
5

6
    while first <= last and not found:
7
        midpoint = (first + last)//2
8
        if alist[midpoint] == item:
9
            found = True
10
        else:
11
            if item < alist[midpoint]:
12
                last = midpoint - 1
13
            else:
14
                first = midpoint + 1
15
    return found

1
def binarySearch(alist,item):
2
    if len(alist) == 0:
3
        return False
4
    else:
5
        midpoint = len(alist)//2
6
        if alist[midpoint] == item:
7
            return True
8
        else:
9
            if item < alist[midpoint]:
10
                return binarySearch(alist[:midpoint],item)
11
            else:
12
                return binarySearch(alist[midpoint+1:],item)

1
def bubbleSort(alist):
2
    for passnum in range(len(alist)-1,0,-1):
3
        for i in range(passnum):
4
            if alist[i]>alist[i+1]:
5
                temp = alist[i]
6
                alist[i] = alist[i+1]
7
                alist[i+1] = temp

1
nums = [5,3,6,4,1,2,8,7]
2
for i in range(1,len(nums)):
3
    for j in range(i):
4
        if nums[i] < nums[j]:
5
            ins = nums[i]
6
            nums.pop(i)
7
            nums.insert(j,ins)
8
            break
9
print(nums)

1
nums = [5,3,6,4,1,2,8,7]
2
res = []
3
while len(nums):
4
    minInd = 0
5
    for i in range(1,len(nums)):
6
        if nums[i] < nums[minInd]:
7
            minInd = i
8
    temp = nums[minInd]
9
    nums.pop(minInd)
10
    res.append(temp)
11
print(res)