The Worst case occur in linear search algorithm when _________

The Worst case occur in linear search algorithm when

A

Item is somewhere in the middle of the array

B

Item is not in the array at all

C

Item is the last element in the array

D

Item is the last element in the array or is not there at all

The usual O(n2) implementation of insertion sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running time will

A

remain O(n²)

B

become O(n(log n)²)

C

become O(n logn)

D

become O(n)

The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?

A

O(nlogn)

B

O(n2)

C

O(n)

D

O(logn)

Can linear search recursive algorithm and binary search recursive algorithm be performed on an unordered list?

A

Binary search can’t be used

B

Linear search can’t be used

C

Both cannot be used

D

Both can be used

What is the worst case runtime of linear search(recursive) algorithm?

A

O(n)

B

O(logn)

C

O(n2)

D

O(nx)

The Worst case occurs in linear search algorithm when ____________

A

Item is somewhere in the middle of the array

B

Item is not in the array at all

C

Item is the last element in the array

D

Item is the last element in the array or is not there at all

Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?

A

O(log V)

B

O(V2)

C

O(E2)

D

O(V log E)

What is the best case and worst case complexity of ordered linear search?

A

O(nlogn), O(logn)

B

O(logn), O(nlogn)

C

O(n), O(1)

D

O(1), O(n)

We create a binary search tree B1 by inserting the numbers 1, 2, 3, 4, 5 into an empty binary search tree. We create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?

A

1

B

3

C

4

D

2

The Fourth Amendment to the Constitution protects citizens against unreasonable searches and seizures. No search of a person's home or personal effects may be conducted without a written search warrant issued on probable cause. This means that a neutral judge must approve the factual basis justifying a search before it can be conducted.
This paragraph best supports the statement that the police cannot search a person's home or private papers unless they have

A

legal authorization.

B

direct evidence of a crime.

C

read the person his or her constitutional rights.

D

a reasonable belief that a crime has occurred.

E

requested that a judge be present.

The Worst case occur in linear search algorithm when _________

Related Questions