python3

What is the best running time taken to determine the largest element in a sorted array of length n? The array doesn't contain duplicates.

Question 1 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 2 (1 point)

What is the best running time taken to determine the largest element in a unsorted array of length n? The array may contain duplicates.

Question 2 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 3 (1 point)

What is the best running time taken to determine the 8th smallest value in a sorted array of length n ? The array doesn't contain duplicates.

Question 3 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 4 (1 point)

What is the best running time taken to print every possible permutation of a string length n?

Question 4 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)
	O(n!) <--- This one, trust me!

Question 5 (1 point)

What is the best running time taken to determine the largest element in a sorted array of length n? The array may contain duplicates.

Question 5 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 6 (1 point)

What is the best running time taken to determine the smallest element in a unsorted array of length n? The array doesn't contain duplicates.

Question 6 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 7 (1 point)

What is the best running time taken to print the first character of a string of length n?

Question 7 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 8 (1 point)

What is the best running time taken to print the last character of a string of length n?

Question 8 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 9 (1 point)

What is the best running time taken to determine if there is a specific value in a unsorted array of length n? The array may contain duplicates.

Question 9 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 10 (1 point)

What is the best running time taken to print the letter 'A'.

Question 10 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 11 (1 point)

What is the best running time taken to print a string of length n?

Question 11 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 12 (1 point)

What is the best running time taken to determine the smallest element in a sorted array of length n? The array doesn't contain duplicates.

Question 12 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 13 (1 point)

What is the best running time taken to determine if there is a specific value in a sorted array of length n? The array may contain duplicates.

Question 13 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 14 (1 point)

What is the best running time taken to determine the smallest element in a sorted array of length n? The array may contain duplicates.

Question 14 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 15 (1 point)

What is the best running time taken to determine the 8th smallest value in a sorted array of length n ? The array may contain duplicates.

Question 15 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 16 (1 point)

What is the best running time taken to determine the smallest element in a unsorted array of length n? The array may contain duplicates.

Question 16 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)

Question 17 (1 point)

What is the best running time taken to determine the largest element in a unsorted array of length n? The array doesn't contain duplicates.

Question 17 options:

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n 2)
	O(n k) where k is a constant > 2
	O(2 n)