ArrayList is based on an array. When deleting, the get position is O (1), and the delete complement is O (n). LinkedList is based on a linked list, and when deleted, the location is O (n), and the deletion is O (1). The operation of inserts is the sam...
try to change the sort (), method of LinkedList, which originally implements interface list, but always reports an error. Please point out: import java.util.*; public class TestSort { LinkedList mtn = new LinkedList(); public static void main...