Method sort

src/fl/stl/list.h:499–526

    }

    void sort() {
        // Insertion sort for simplicity (appropriate for embedded systems)
        if (mSize <= 1) {
            return;
        }

        Node* sorted_end = mHead->next;

        while (sorted_end->next != mHead) {
            Node* current = sorted_end->next;

            // Find insertion point in sorted portion
            Node* insert_pos = mHead->next;
            while (insert_pos != sorted_end->next && insert_pos->data < current->data) {
                insert_pos = insert_pos->next;
            }

            // If current is already in correct position
            if (insert_pos == current) {
                sorted_end = current;
            } else {
                // Remove current from its position
                unlink(current);
                // Insert before insert_pos
                link_before(insert_pos, current);
            }
        }
    }

    template<typename Compare>
    void sort(Compare comp) {