8_1
No
8_2
Arraylists. Maybe queues, but that's pushing it.
8_3
you could have a temp which checks all the objects in a queue, and then adds them into another queue, if the object is the same as what you are looking for, you add it twice, otherwise you continue dumping everything into the other queue, which then becomes your base queue for next time the method is called.
8_4
I believe they are called hash tables because they split the data into parts. I honestly still don't completely understand the process.
8_5
No
8_2
Arraylists. Maybe queues, but that's pushing it.
8_3
you could have a temp which checks all the objects in a queue, and then adds them into another queue, if the object is the same as what you are looking for, you add it twice, otherwise you continue dumping everything into the other queue, which then becomes your base queue for next time the method is called.
8_4
I believe they are called hash tables because they split the data into parts. I honestly still don't completely understand the process.
8_5
