mirror of https://github.com/TheAlgorithms/C
8a1a4972a5
I changed the return value of n in List_length to reflect the number of items inside the list, so a newly initialized list will return a length of 0. To prevent items in List_toArray from being cut off, I addeone back to n at the beginning of the List_toArray function. |
||
|---|---|---|
| .. | ||
| array | ||
| binary_trees | ||
| dictionary | ||
| dynamic_array | ||
| graphs | ||
| hash_set | ||
| heap | ||
| linked_list | ||
| list | ||
| queue | ||
| stack | ||
| trie | ||
| stack.c | ||
| vector.c | ||