Python 알고리즘 Quick books
Bubble Sort Algorithm arr = [7, 3, 9, 2, 0, 4, 8, 1, 6, 5] def bubbleSort(theSeq): n = len(theSeq) for i in range(n - 1): for j in range(n - 1 - i): if theSeq[j] > theSeq[j + 1]: temp = theSeq[j] theSeq[j] = the Seq[j + 1] theSeq[j + 1] = temp return theSeq print(bubbleSort(arr)) Printing Prime Numbers #printing prime numbers in a range lower = 100 upper = 200 for num in range(lower, upper+1): i..