QUESTION 6

The worst-time complexity for selection sort is ________.

O(1)

O(logn)

O(n)

O(nlong)

O(n*n)

QUESTION 9

In the implementation of MyLinkedList, last.next is always null.

True

False

QUESTION 10

In the implementation of MyArrayList, capacity is the length of the array used to store the elements in the list.

True

False

QUESTION 11

O(n*n) is ________.

constant time

logarithmic time

linear time

log-linear time

QUESTION 10

In the implementation of MyArrayList, capacity is the length of the array used to store the elements in the list.

True

False

QUESTION 13

In the implementation of MyLinkedList, Node is defined as a static inner class inside MyLinkedList because it does not reference any instance data fields in MyLinkedList.

True

False

QUESTION 15

A heap is a full binary tree.

True

False

1 points

QUESTION 17

The time complexity for the Euclid's algorithm is ________.

O(n)

O(n^2)

O(logn)

O(2^n)

QUESTION 20

The worst-time complexity for linear search is ________.

		O(1)
		O(logn)
		O(n)
		O(nlong)
		O(n*n) QUESTION 21 In the implementation of MyLinkedList, Node has a property named element that stores an element. True False QUESTION 23 MyArrayList and MyLinkedList are two concrete implementations of MyList. True False