def ll_create_node(name, phone):
    return {'name': name, 'phone': phone, 'next': None}

def ll_insert(head, name, phone):
    if head == None:
        return ll_create_node(name, phone)
    
    current = head
    while current['next'] != None:
        if current['name'] == name:
            current['phone'] = phone
            return head
        current = current['next']
    
    if current['name'] == name:
        current['phone'] = phone
    else:
        current['next'] = ll_create_node(name, phone)
    
    return head

def ll_find(head, name):
    current = head
    while current != None:
        if current['name'] == name:
            return current['phone']
        current = current['next']
    return None

def ll_delete(head, name):
    if head == None:
        return None
    
    if head['name'] == name:
        return head['next']
    
    current = head
    while current['next'] != None:
        if current['next']['name'] == name:
            current['next'] = current['next']['next']
            return head
        current = current['next']
    
    return head

def ll_list_all(head):
    items = []
    current = head
    while current != None:
        items.append((current['name'], current['phone']))
        current = current['next']
    
    for i in range(len(items)):
        for j in range(i + 1, len(items)):
            if items[i][0] > items[j][0]:
                temp = items[i]
                items[i] = items[j]
                items[j] = temp
    
    return items