

def selection_sort(items):
    num_items = len(items)
    if (num_items < 2):
        return items
    curr_min = 0
    for j in range(num_items):
        curr_min = j
        for i in range((j + 1), num_items):
            if (items[i] < items[curr_min]):
                curr_min = i
        if (curr_min != j):
            swap_item(items, j, curr_min)
    return i

dataset/ETHPy150Open christabor/MoAL/MOAL/algorithms/sorting/selection_sort.py selection_sort/VarMisuse@106/134 `items`->`i`