Skip to content

Instantly share code, notes, and snippets.

@ahmaddidiks
Created May 13, 2023 14:53
Show Gist options
  • Save ahmaddidiks/dc7a621d9844f697a456ef4bc74e614a to your computer and use it in GitHub Desktop.
Save ahmaddidiks/dc7a621d9844f697a456ef4bc74e614a to your computer and use it in GitHub Desktop.
Bib Nabiel
def isGanjil(num):
if num %2 == 1:
return True
else:
return False
def showMinimumNumber(listNumber):
# membuat list angka yang isinya hanya angka ganjil
newNumberList = []
for number in listNumber:
if isGanjil(number):
newNumberList.append(number)
# mencari nilai terkecil dari list angka ganjil
minimumNumber = newNumberList[0] # ambil angka pertama dari list
for number in newNumberList:
if number < minimumNumber:
minimumNumber = number
print(minimumNumber)
# test
A = [6,7,4,3,2]
B = [10, 9, 5, 6, 8, 1000, 1]
print("nilai minimum dari A adalah")
showMinimumNumber(A)
print("nilai minimum dari B adalah")
showMinimumNumber(B)
#bubble sort descending
def bubble(st):
print("sebelum bubble sort: ", st)
for i in range(len(st),1,-1):
for j in range(0,i-1):
if st[j]<st[j+1]:
st[j],st[j+1]=st[j+1],st[j]
else:
pass
print("seudah bubble sort: ", st)
def selection_sort(numbers):
print("sebelum selection sort:", numbers) #size/length is = 5
for i in range(len(numbers)-1): #0,1,2,3 (Iteration 4)
# menemukan nilai minimum dari partisi ke sisa data
# partisi/indeks bergerak ke kanan
for j in range(i+1, len(numbers)):
# membandingkan nilai indeks yang dipilih dengan nilai indeks berikutnya
if numbers[j] > numbers[i]:
# menukar nilai kiri partisi dengan nilai kanan
numbers[i], numbers[j] = numbers[j], numbers[i]
print('sesudah selection sort:', numbers)
#test
A = [64, 34, 25, 12, 22, 11, 90]
B = [64, 34, 25, 12, 22, 11, 90]
bubble(A)
selection_sort(B)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment