What is the time complexity of the most efficient algorithm that determines if an item is contained in a sorted list implemented via an array?

	O(1)
	O(log n)
	O(n)
	O(n log n)
	None of the above

What is the time complexity of inserting an element into an unsorted list implemented using an array? Assume the maximum capacity of the array has not been reached.

	O(1)
	O(log n)
	O(n)
	O(n log n)
	O(n * n)