$14\mathrm{.}28$ LAB: Library book sorting

Two sorted lists have been created, one implemented using a linked list $($LinkedListLibrary class$)$ and the other implemented using the

buit$-$in Vector class $($VectorLibrary class$).$ Each list contains $100$ books $($title$,$ ISBN number, author$),$ sorted in ascending order by ISBN

number.

Complete main$()$ by inserting a new book into each list using the respective LinkedListLibrary and VectorLibrary InsertSorted$(0$ functions

and outputting the number of book copy operations the computer must perform to insert the new book. Each InsertSorted$(0$ retums the

number of book copy operations the computer performs.

Ex$.$ If the input is:

the output is:

Nunber of linked list book copy operations: $1$

Nunber of vector book copy operations: $95$

Which list do you think will requive the most operations? Why? c$++14\mathrm{.}28$ LAB: Library book sorting

Two sorted lists have been created, one implemented using a linked list $($LinkedListLibrary class$)$ and the other implemented using the

buit$-$in Vector class $($VectorLibrary class$).$ Each list contains $100$ books $($title$,$ ISBN number, author$),$ sorted in ascending order by ISBN

number.

Complete main$()$ by inserting a new book into each list using the respective LinkedListLibrary and VectorLibrary InsertSorted$(0$ functions

and outputting the number of book copy operations the computer must perform to insert the new book. Each InsertSorted$(0$ retums the

number of book copy operations the computer performs.

Ex$.$ If the input is:

the output is:

Nunber of linked list book copy operations: $1$

Nunber of vector book copy operations: $95$

Which list do you think will requive the most operations? Why? c$++$