InfatuatedStaidFraction created by siyuYan - https://repl.it/@siyuYan/InfatuatedStaidFraction

BubbleSort.py

def bubble_sort(numbers:list)->list:
  length = len(numbers)
  for i in range(length):
    for j in range(0,length-i-1):
      if numbers[j]>numbers[j+1]:
        numbers[j],numbers[j+1] = numbers[j+1],numbers[j]
  return numbers

HelloNumbers.py

def func():
  x = 0
  while x < 10:
    print(x)
    x = x + 1

helloWorld.py

print('hello world!')

InsertionSort.py

def insertion_sort(nums:list)->list:
  length = len(nums)
  for i in range(1,length):
    while nums[i]<nums[i-1]:
      nums[i],nums[i-1] = nums[i-1],nums[i]
  return nums

Larger.py

def larger(x,y):
  if (x>y):
    return x
  return y

main.py

from BubbleSort import bubble_sort
from SelectionSort import selection_sort
from InsertionSort import insertion_sort
from ShellSort import shell_sort
from MergeSort import merge_sort
from MergeSort import merge
from HelloNumbers import func
from Larger import larger

nums = [3,5,2,1]

print('hello world!')

print(bubble_sort(nums))
print(selection_sort(nums))
print(insertion_sort(nums))
print(shell_sort(nums))
# print(merge_sort(nums))
print(merge(nums,nums))

func()
print(larger(-1,2))

MergeSort.py

def merge(left,right):
  ans = []
  while left and right:
    if left[-1] <= right[-1]:
      ans.append(left.pop())
    else:
      ans.append(right.pop())
  while left:
    ans += left
  while right:
    ans += right
  return ans

def merge_sort(nums:list)->list:
  length = len(nums)
  if length<2:
    return nums
  left = nums[:length//2]
  right = nums[length//2:]
  return merge(merge_sort(left),merge_sort(right))

QuickSort.py

def swap(a,b):
  a,b=b,a
  return True

def quick_sort(nums:list)->list:
  length = len(nums)
  if length<2:
    return nums
  return quick_sort(partition[0])+quick_sort(partition[1])

def partition(nums:list)->list:
  left = []
  right = []
  pivot = nums[0]
  for num in nums[1:]:
    if num<pivot:
      left.append(num)
    else:
      right.append(num)
  return left,right

SelectionSort.py

def selection_sort(nums:list)->list:
  minimum = float('inf')
  length = len(nums)
  for i in range(length):
    for j in range(i,length):
      if nums[j]<=minimum:
        minimum = nums[j]
        index = j
        nums[i], nums[index] = nums[index], nums[i]
  return nums

ShellSort.py

def shell_sort(nums:list)->list:
  gap = 3
  length = len(nums)
  for i in range(gap):
    for j in range(length):
      for k in range(gap,length):
        while nums[k]<=nums[k-gap]:
          nums[k],nums[k-gap] = nums[k-gap],nums[k]
  return nums

Sort