Greedy algorithm

rowannakamura554 22.05.2026 11:26

Greedy algorithm

Work in progress

core.py

def max_in_list(lst):
    m = lst[0]
    for x in lst:
        if x > m: m = x
    return m

print(max_in_list([3, 7, 1, 9, 4]))

algo.py

class Node:
    def __init__(self, val):
        self.val = val
        self.next = None

class LinkedList:
    def __init__(self):
        self.head = None
    def append(self, val):
        if not self.head:
            self.head = Node(val)
            return
        cur = self.head
        while cur.next: cur = cur.next
        cur.next = Node(val)
    def display(self):
        cur = self.head
        while cur:
            print(cur.val, end=' ')
            cur = cur.next
        print()

ll = LinkedList()
ll.append(1); ll.append(2); ll.append(3)
ll.display()

Greedy algorithm

Are you sure you want to delete this post?