Question

Array lists and linked lists are both implementations of lists. Write a program in java of a situation where an array list would be the better choice and one program where a linked list would. Explain the reasons in each case.

Answer 1

ArrayList is best when you want to perform searching and sorting because we can access the ArrayList elements very quickly. because ArrayList works based on the indexes..

LinkedList is best when we have operations like inserting and deleting elements because we just adds and removes the link and no need to shuffle any elements so it takes less time

Program:

import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;

public class Program1 {
   public static void main(String[] args) {
       LinkedList<Integer> list2 = new LinkedList<Integer>();
       // When array list is best
       ArrayList<Integer> list1 = new ArrayList<Integer>();
       list1.add(1);
       list1.add(2);
       list1.add(3);
       list1.add(4);
       list1.add(5);

       Collections.sort(list1);

       // When Linked list best;
       list2.add(1);
       list2.add(2);
       list2.add(3);
       list2.add(41);
       list2.add(12);
       list2.add(11);
       list2.add(21);
       list2.add(11);
       list2.add(14);
       list2.add(15);
       list2.add(112);
       list2.add(112);
       list2.add(121);
       list2.remove(1);
       list2.remove(2);
       list2.remove(3);
       list2.remove(5);
       list2.remove(6);
       list2.add(11);
       list2.add(14);
       list2.add(15);
       list2.add(112);

System.out.println(list1);
       System.out.println(list2);

   }
}

Note : Please comment below if you have concerns. I am here to help you

If you like my answer please rate and help me it is very Imp for me