TP 9 exo2: Implement a merge sort function for the linked list.

[TD_C.git] / TP_9 / exo2 / clist.h

diff --git a/TP_9/exo2/clist.h b/TP_9/exo2/clist.h
index ec1c13a47aefd378e52a4634c940539e9c99c0b4..2ca575290bae8527ca621277ff2d92cb354167c7 100644 (file)
--- a/TP_9/exo2/clist.h
+++ b/TP_9/exo2/clist.h
@@ -10,9 +10,15 @@ typedef struct link_s {
 link_t* list_new(int value); 
 link_t* list_append(link_t* head, int value); 
 link_t* list_prepend(link_t* head, int value); 
+link_t* list_insert(link_t* head, unsigned index, int value);
+link_t* list_delete(link_t* head, unsigned index);
+link_t* list_concat(link_t* first, link_t* second);
+link_t* list_sort(link_t* head);
+link_t* list_merge_sort(link_t* head);
 unsigned list_count(link_t* head);
 void list_set(link_t* head, unsigned index, int value);
 int list_get(link_t* head, unsigned index);
-void list_clear(link_t* link);
+void list_clear(link_t* head);
+void list_display_values(link_t* head);
 
 #endif /* CLIST_H */