Heap sort

finleygarcia275 22.05.2026 10:58

Heap sort

Rewrote old code

handler.py

def is_prime(n):
    if n < 2: return False
    for i in range(2, int(n**0.5)+1):
        if n % i == 0: return False
    return True

print(is_prime(17))

test.py

def hello():
    print("Hello, World!")

main.py

def is_prime(n):
    if n < 2: return False
    for i in range(2, int(n**0.5)+1):
        if n % i == 0: return False
    return True

print(is_prime(17))

Heap sort

Are you sure you want to delete this post?