Question

Please give little explanation, I'm trying to understand why.

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

O(1)

O(n)

O(n ^ 2)

O(log n)

A. Directly Accessing value in a 2-dimensional by [row][column]
B. Selection Sort then Binary Search on a 1,000,000 element array
C. Binary Search
D. Highest element algorithm for 10,000 element array.
E. Traversal of 6 character string	O(n)

3. Give examples of Implicit declarations for Python and C++. Give examples of explicit declarations for Python and C++.

Answer 1

`Hey,

Note: If you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

1)

Directly Accessing value in a 2-dimensional by [row][column] is O(1) since accessing is 1 operation

2)

Selection Sort then Binary Search on a 1,000,000 element array is O(n^2) since selection sort takes O(n^2)

3)

Binary Search is O(log(n))

4)

Highest element algorithm for 10,000 element array is O(n) since it uses 1 loop

5)Traversal of 6 character string O(n)

Note: Brother According to Chegg's policy we are only allowed to answer first Q if there are many. So, I request you to post other part as separate posts

Kindly revert for any queries

Thanks.