- Global list_append (list_t *, list_t *)
- Improvements are possible and planned:
- the time complexity of the current implementation is O(N) where N indicates the number of nodes in a list. With a circular list, where the next node of the last node set to the head, it is possible for both pushing and appending to be done in a constant time.
- Global list_append (list_t *, list_t *)
- Improvements are possible and planned:
- the time complexity of the current implementation is O(N) where N indicates the number of nodes in a list. With a circular list, where the next node of the last node set to the head, it is possible for both pushing and appending to be done in a constant time.