List appropriate Worst Case Big O Notation under the different algorithms or data structure operations.

O(1)

O(n)

O(n ^ 2)

Modified Bubble Sort on a 1,000,000 element array
Directly Accessing value in a 2-dimensional by [row][column]
Linear Search of a 100 element array.
Accessing middle element in an array by index
Traversal of 20 character string