Jawaban:

Berikut implementasi dalam bahasa pemrograman python

Bubble Sort:

def a(x):

for i in range(len(x)-1,0,-1):

for j in range(i):

if x[j]>x[j+1]:

temp = x[j]

x[j]=x[j+1]

x[j+1]=temp

angka = [47,10,98,1001,8,79,100,55,78,18]

a(angka)

print(angka)

maka outputnya adalah: [8, 10, 18, 47, 55, 78, 79, 98, 100, 1001]

merge short:

# MergeSort in Python

def mergeSort(array):

   if len(array) > 1:

       #  r is the point where the array is divided into two subarrays

       r = len(array)//2

       L = array[:r]

       M = array[r:]

       # Sort the two halves

       mergeSort(L)

       mergeSort(M)

       i = j = k = 0

       # Until we reach either end of either L or M, pick larger among

       # elements L and M and place them in the correct position at A[p..r]

       while i < len(L) and j < len(M):

           if L[i] < M[j]:

               array[k] = L[i]

               i += 1

           else:

               array[k] = M[j]

               j += 1

           k += 1

       # When we run out of elements in either L or M,

       # pick up the remaining elements and put in A[p..r]

       while i < len(L):

           array[k] = L[i]

           i += 1

           k += 1

       while j < len(M):

           array[k] = M[j]

           j += 1

           k += 1

# Print the array

def printList(array):

   for i in range(len(array)):

       print(array[i], end=" ")

   print()

# Driver program

if __name__ == '__main__':

   array = [6, 5, 12, 10, 9, 1]

   mergeSort(array)

   print("Sorted array is: ")

   printList(array)

maka outputnya adalah: [1, 5, 6, 9, 10, 12]

Penjelasan:

Semoga membantu