Problem:
Question 1: Please show- a linked list implementation and an array implementation in java and explain the differences.
for building linked lists- please explain- insert at begining, remove from begining, insert at the end, and insert/remove at other positions.
Question 2: Please explain stack, queue, and bag implementation
please provide [in java] a iterative and recursive solution (example code)- please explain differences and explain what the code is doing.
Question 3: Explain differences, charactoristics, advantages, disadvantages, and differences in running time for-- insertion, selection, merge, and quicksort.
Question 4: Please also provide java code snippets for each of the different orders of growth. e.g., constant, logarithmic, linear, linearithmic, quadratic, cubic, and exponential/
Question 5: Explain Shellsort and heapsort.
Please provide description of your answers.