adplus-dvertising
frame-decoration

Question

Which algorithm has same average, worst case and best case time?

a.

Binary search

b.

Maximum of n numbers

c.

Quick sort

d.

Fibonacci search

Answer: (b).Maximum of n numbers

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which algorithm has same average, worst case and best case time?

Similar Questions

Discover Related MCQs

Q. Application of data structure in queue is:

Q. The number of edges in a complete graph with N vertices is equal to:

Q. Which algorithm has same average, worst case and best case time?

Q. Binary search tree is an example of:

Q. What is the time required to insert an element in a stack with linked implementation?

Q. The equivalent postfix expression for d/(e+f) + b*c:

Q. Which one of the following is a physical data structure ?

Q. Which of the following statement is false ?

Q. If the postfix form of a string is ABC+-D*, the actual string is:

Q. Application of data structure queue is:

Q. T is a graph with n vertices. T is connected and has exactly n-1 edges, then:

Q. In what tree, for every node the height of its left subtree and right subtree differ at least by one:

Q. A hash function f defined as f(key) = key mod 7, with linear probing it is used to insert the key 37, 38, 72, 48, 98, 11, 56 into a table index from 0 to 6. What will be the locations of 11?

Q. The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required:

Q. Which traversal technique lists the nodes of a binary search tree in ascending order?

Q. What is the time required to insert an element in a stack with linked implementation ?

Q. Which of the following statement is false ?

Q. The algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent pairs of numbers like : { 1, 3, 2, 5, 4, 6} is:

Q. The following lists are the degrees of all the vertices of a graph:

(i) 1, 2, 3, 4, 5                (ii) 3, 4, 5, 6, 7
(iii) 1, 4, 5, 8, 6              (iv) 3, 4, 5, 6

then, which of the above sequences are graphic?

Q. What item is at the root after the following sequence of insertions into an empty splay tree:
1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2 ?