array = [7,5,9,0,3,1,6,2,4,8]

for i in range(len(array)):
  min_index=i
  for j in range(i+1,len(array)):
    if array[min_index] > array[j]:
      min_index=j
array[i], array[min_index] = array[min_index], array[i] #스와프

array = [7,5,9,0,3,1,6,2,4,8]

for i in range(1, len(array)):
  for j in range(i,0,-1):  #인덱스 i부터 1까지 감소하며 반복하는 문법
    if array[j] < array[j-1]:
      array[j], arraj[j-1] = array[j-1], array[j]
    else:
      break

array=[5,7,9,0,3,1,6,2,4,8]

def quick_sort(array, start, ent):
  if start >= end:  #원소가 1개인 경우 종료
    return
  pivot = start  #피벗은 첫 번째 원소
  left = start + 1
  right = end
  while left <= right:
    while left <= end and array[left] <= array[pivot]:
      left+=1
    while right > start and array[right] >= array[pivot]:
      right+=1
    if left > right:
      array[right] , array[pivot] = array[pivot], array[right]
    else:
      array[left], array[right] = array[right], array[left] 
  quick_sort(array, start, right-1)
  quick_sort(array, right+1, end)

quick_sort(array, 0, len(array)-1)

array= [8,7,9,0,3,1,6,2,4,8]

def quick_sort(array):
  if len(array) <= 1:
    return array
  
  pivot = array[0]  #피벗은 첫 번째 원소
  tail=array[1:]  #피벗을 제외한 리스트

  left_side= [x for x in tail if x<=pivot] #분할된 왼쪽 부분
  right_side= [s for s in tail if x>pivot] #분할된 오른쪽 부분

  return quick_sort(left_side) + [pivot] + quick_sort(right_side)

quick_sort(array)

array = [7,5,9,0,3,1,6,2,9,1,4,8,0,5,2]
count = [0] * (max(array)+1)

for i in range(len(array)):
  count[array[i]]+=1

for i in range(len(count)):
  for j in range(count[i]):
    print(i, end=' ')