def sum_lists(list1, list2):
    sums = []

    for i in range(len(list1)):
        sums += [list1[i] + list2[i]]

    return sums

def sum_of_list(nums):
    sums = 0

    for num in nums:
        sums += num

    return sums

def selection_sort(nums):
    """
    1. Start a new empty "sorted" list
    2. Find smallest element in unsorted list
    4. Remove that element from unsorted list
    3. append to sorted list
    5. Go to 2, or stop if no more elements in unsorted
    """
    unsorted = nums[:]
    sorted_list = []

    #while unsorted:
    while unsorted != []:
        smallest = 0
        for i in range(len(unsorted)):
            if unsorted[i] < unsorted[smallest]:
                smallest = i

        sorted_list += [unsorted[smallest]]
        unsorted = unsorted[:smallest] + unsorted[smallest + 1:]

    return sorted_list