🧩 Standard Algorithms

nums = [10, 20, 30]
total = 0
for n in nums: total += n
avg = total / len(nums)

highest = nums[0]
for n in nums:
    if n > highest: highest = n

target = 20; found = False
for i in range(len(nums)):
    if nums[i] == target: found = True

n = len(nums)
for i in range(n):
    for j in range(0, n-i-1):
        if nums[j] > nums[j+1]:
            nums[j], nums[j+1] = nums[j+1], nums[j]