Both methods of implementation have their associated strengths and weaknesses. In the first approach, the method of implementation uses an array of structs to hold the information of the cars. The problem with doing this is that an array’s size is fixed at compile time. In this case the array size is specified to be 500. If the program doesn’t use all 500 spaces, then the memory allocated at compile time is wasted. Also, since the size is fixed, no other cars can be added once the 500 have been used. One major advantage the array has over the linked list
Example Essays Home
