-
Notifications
You must be signed in to change notification settings - Fork 0
Linked List programs in C that allow the user to control the data container (memory allocation). In main.c, users can create and delete nodes, input or delete nodes at specified positions, display the list of nodes, count nodes in the list, and search the list for a specified node. In collatz.c I use a linked list in a mathematical application.
License
QUAY17/linked_list
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
Jennifer Quay Minnich 11/09/20 Lab 8: Linked Lists, Memory Allocation, Valgrind, and Pointers Purpose_ Lab 8 was based around linked lists. In main.c I created a menu structure and let the user choose how to store data and what to do with it after creating a list. Linked lists allow us to store data that is dynamically sized. There were a lot of use cases to cover in the menu structure to meet the lab specs and also for general error handling. We used malloc to request space and freed the space at the end of the program. In a mathematical application of implementing a linked list, the collatz.c short program uses a linked list to generate the collatz / hailstone sequence.
About
Linked List programs in C that allow the user to control the data container (memory allocation). In main.c, users can create and delete nodes, input or delete nodes at specified positions, display the list of nodes, count nodes in the list, and search the list for a specified node. In collatz.c I use a linked list in a mathematical application.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published