The primary difference between the OrderedList ADT and the UnorderedList ADT is in how elements are removed from the list A. True B. False

A user does not have any control over the order of the elements in an unordered list A. True B. False

The remove operation returns a boolean value that indicates if the element to be removed was found in the list. A. True B. False

A remove operation for a list ADT removes the specified item. Given a list with contents: 2, 20, 30, what is the list after the following operation?Remove(list, item 2)

The addAfter operation of an unordered list collection is A. O(log n) B. O(n) C. a higher order than O(n log n) D. O(n log n) E. O(1)

In which  sort algorithm divides the list into two parts, sorted and unsorted. Initially, the sorted part contains only one element. In each pass, one element from the unsorted list is inserted at its correct position in the sorted list. As a result, the sorted list grows by one element and the unsorted list shrinks by one element in each pass.