버블 정렬 구현해보기

aa = [8, 1, 2, 3, 4]
def bubble_solt(array):
for i in range(len(array)):
for n in range(len(array) - 1 - i):
bin = 0
if array[n] > array[n + 1]:
bin = array[n + 1]
array[n + 1] = array[n]
array[n] = bin
return array
print(bubble_solt(aa))
선택 정렬 구현해보기

aa = [8, 1, 2, 3, 4]
def bubble_solt(array):
for i in range(len(array) - 1):
min_index = i # 파티션을 나눠
for j in range(len(array) - i):
if array[i + j] < array[min_index]:
min_index = i + j # 가장작은친구
(array[i], array[min_index]) = (array[min_index], array[i])
return array
print(bubble_solt(aa))
삽입 정렬 구현해보기
aa = [8, 1, 2, 3, 4]
def insertion_sort(arr):
for i in range(1, len(arr)):
for j in range(i, 0, -1):
if arr[j]<arr[j-1]:
arr[j], arr[j-1] = arr[j-1], arr[j]
else:
break
return arr
print(insertion_sort(aa))

GET /146 HTTP/1.1
host
user-agent
accept-encoding

HTTP/1.1 200
content-Type
content-encoding