This program has to handle a retail company's inventory control system. I am supposed to create a singly linked list to store and manipulate a company's inventory product records. Basically each node in a linked list is a struct that contains a product's name, and unit price, and quantity in stock. In addition each node has a pinter, called pNext, that points to the next node int he list. The last node's pNext should be NULL. How am I to implement teh function prototypes?
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "irecord.h"
main(void)
(
int iNum,i;
char Name[NAMESIZE];
double dValue;
Node *pMyList=NULL;
Node *pNewNode=NULL;
printf("Welcome to the Linked List
exercise.\n\n");
printf("Enter the number of records
you want to input ");
scanf("%d",&iNum);
printf("\nThanks. You entered %d\n\n",
iNum);
for (i=0; i<iNum; I++)
(
pNewNode=CreateNode(Name, dValue,
20);
InsertNode(&pMyList,pNewNode);
)
printf("Thank you.\n\n");
printf("Here is your list:\n");
ShowList(pMyList);
return 0;
)
Node* CreateNode(char *eName, double dPrice,int iQuantity);
(
return NULL;
)
int InsertNode(Node **ppList, Node *pNode);
(
return 1;
)
int ShowList(Node*pList);
(
return 1;
)
int RemoveAll(Node **ppList);
(
return 1;
)
int DeleteFirst(Node **ppList,char *eName);
(
return 1;
)
int IncrementQuantity(Node *pList, char *eName,
int iIncrement);
(
return 1;
)
int ShowCheaperProducts(Node *pList, double
int dPrice);
(
return 1;
)
