I agree with what xDELLx said about how to change your code to print the right thing.
Also, as he said, it's advised to tell the steps you took to end up with the error.
After applying the fix suggested by xDELLx I wasn't able to run into a Segmentation Fault.
You can use typedef to make your code easier to read and shorter too. For instance with typedef struct part would look something like this:
struct part *next;
Part *inventory = NULL; /* points to first part */
Part *find_part(int number);
So instead of writing "struct part" you can just reference your type via "Part".
A Slight Variant of Code
I'm sharing my take on the insert/find problem.
The main difference is that the search function (tryFind()) has an out parameter that returns the pointer to the found part. If not found, it returns the pointer where it should be inserted.
To work with this, insertAt() takes an argument that tells where the new part should be inserted.
// Tries to find a part based on it's number.
// If found, returns true (non-zero) and *part points to the found part.
// If not found, returns false (zero) and *part points to the part where a new one with the given number could be inserted
int tryFind(int number, Part ** part)
Part * cur = inventory;
Part * prev = NULL;
while (cur != NULL && number > cur->number)
cur = cur->next;
prev = prev != NULL ? prev->next : inventory;
// Part number found. Part points
if (cur && cur->number == number)
*part = cur;
// Part number not found
*part = prev;
// Insert a new part with (number, name, onHand) at a given position
// position: the part, after the new part should be inserted. Provide NULL if the part needs to go to the head of the list.
// number: the part number
// name: the name of the part
// onHand: the number of parts availabel on hand
void insertAt(Part * position, int number, const char * name, int onHand)
Part * newPart = (Part*)malloc(sizeof(Part));
newPart->number = number;
strncpy(newPart->name, name, sizeof(newPart->name));
newPart->on_hand = onHand;
if (position == NULL)
newPart->next = inventory;
inventory = newPart;
newPart->next = position->next;
position->next = newPart;
So with these two functions above a simple insert would look something like this:
void insertHelper(int number, const char * name, int count)
Part * part;
if (tryFind(number, &part))
printf("Part already found: %p\n", part);
insertAt(part, number, name, count);