Johannes Alexander Putra's Blog

  arr = [ 25 , 27 , 10 , 8 , 76 , 21 ] def  bubblesort(arr,N):      for  i  in  range( 0 ,N):          for  k  in   range( 5 ,i,- 1 ):                         if (arr[k] < arr[k- 1 ]):                temp = arr[k]                arr[k] = arr[k- 1 ]                arr[k- 1 ] = temp  #pemanggilan bubblesort(arr, 6 ) for  q  in  range( 0 , 5 ):     print(arr[q])

  arr = [ 5 , 4 , 3 , 2 , 1 ] def  selectionsort(arr,N):      for  passed  in  range( 0 ,N- 1 ):         minindex = passed           for  j  in  range(passed+ 1 ,N):              if (arr[minindex] > arr[j]):                 minindex = j         tukar = arr[passed]         arr[passed] = arr[minindex]         arr[minindex] = tukar  #pemangilan fungsi selectionsort(arr, 5 ) for  j  in  range( 0 , 5 ):     print(arr[j])

arr = [ 5 , 4 , 3 , 2 , 1 ] def  insertion_sort(arr,N):      for  passed  in  range( 1 ,N):             temp = arr[passed]             i = passed- 1              while  (temp < arr[i]  and  (i>= 0 )):                 arr[i+ 1 ] = arr[i]                 i = i- 1             arr[i+ 1 ] = temp #pemangilan fungsi insertion_sort(arr, 5 ) for  j  in  range( 0 , 5 ):     print(arr[j])