Answer to Question #48015 in Java | JSP | JSF for javabegin
• Your application can live without random access. Because if you need n-th element in LinkedList you need to first traverse up to n-th element O(n) and than you get data from that node.
• Your application is more insertion and deletion driver and you insert or remove more than retrieval. Since insertion or removal doesn't involve resizing its much faster than ArrayList.
Need a fast expert's response?Submit order
and get a quick answer at the best price
for any assignment or question with DETAILED EXPLANATIONS!