For this exercise, write a function that inserts a three-digit part number in a list of part numbers. The list is maintained in increasing numerical order, and duplicate part numbers aren’t allowed. Allocate a maximum list size of 100 values, and use a sentinel value of 9999 to indicate the end of the list. For example, if the current list contains nine part numbers, the 10th position in the list contains the sentinel value. the insertion process for an original list of nine part numbers, using the following processing algorithm: To determine where in the list the new part number should be placed This is done by comparing the new part number to each value in the current list until a match is found, a part number larger than the new part number is located, or the end of the list is encountered If the new part number matches an existing part number, display a message that the part number exists Else To make room for the new element in the array, move each element down one position. This is done by starting from the sentinel value and coping each item to the next position down until the desired position in the list is vacated. Insert the new part number in the vacated position Endif
A common
To determine where in the list the new part number should be placed
This is done by comparing the new part number to each value in the current list until a match is found, a part number larger than the new part number is located, or the end of the list is encountered
If the new part number matches an existing part number,
display a message that the part number exists
Else
To make room for the new element in the array, move each element down one position. This is done by starting from the sentinel value and coping each item to the next position down until the desired position in the list is vacated.
Insert the new part number in the vacated position
Endif
Note:use Binary search OR Linear Search data structure.
Step by step
Solved in 2 steps with 1 images
