Why delete function faster in the linked list as compare to array in J

1.	Why delete function faster in the linked list as compare to array in Java?
Answer» Why delete function faster in the linked LIST as COMPARE to array in Java? Delete Function is faster in linked lists becasue in linked list user needs to make only some MINOR change to the pointer value. Once we change the poniter value node can point to the NEXT SUCCESSOR in the list.

Discussion