선택정렬

def selectionSort(nums):
    rlt = []
    right = nums
    i = 0
    j = len(nums)
    flag = 0

    while(i<j):
      print(i)
      print(j)
      min = right[i]
      for flag in range(i,j):
        if(right[flag]<min):
          min = right[flag]
        flag +=1
      rlt.append(min)
      right.remove(min)
      right.insert(i,min)
      print(right)
      i+=1;
    return rlt



print(selectionSort([7,5,4,2]))

Gudie Answer

def selectionSort(nums):
  for i in range(len(nums)): 
    min_idx = i 
    for j in range(i+1, len(nums)): 
      if nums[min_idx] > nums[j]: 
          min_idx = j 
              
    nums[i], nums[min_idx] = nums[min_idx], nums[i] 
    
  return nums