MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Evaluation of a Determinant

The time comp...

Question

$T h e t i m e c o m p l e x i t y t o d e l e t e a n e l e m e n t a t$
$i n d e x^{'} K^{'} (K \leq n) i n a m i n - h e a p o f s i z e n i s$

A

O (l o g l o g n)

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

O (l o g n)

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

C

O (n)

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

O (n l o g n)

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B $O (l o g n)$
$K b e i n g c o n s t a n t, t o t a l t i m e c o m p l e x i t y$
$i s O (k l o g n) w h i c h i s O (l o g n)$

Suggest Corrections

thumbs-up

0

Similar questions

Consider the binary min heap given below : (min heap is a binary tree where each node in a tree has a key which is less than or equal to the key of its children) Insert the key 1 in above min heap which of the following is the resulant min heap after two delete operations ?

Q. A binary min heap consisting of integers is implemented using array A[l ....n] in which root node is stored at A[1] and locations A[l] through A[n] store the 'n' integer values in the heap. The minimum number of comparisons required to find maximum element in a min heap of 99 elements is

Q. N items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed.
An algorithm performs the following operations on the list in this order:

Θ

(N) delete, O(logN) insert, O(logN) find, and

Θ

(N) decrease-key. What is the time complexity of all these operations put together?

Q. Consider the following implementations for rotating an array A[1, ....n] of size n by K positions , where 1 < = K < = n . Note that the procedure reverse (A, i, j) reverses the order of elements in A between positions i and j in A (both inclusive )
which of the above implementation(s) work correctly for all inputs ?
Implementation I:
reverser(A, 1, K);
reverse(A, 1, n) ;
reverse (A, k+1, n) ;
Implementation II:
reverser(a, K+1, n);
reverse(a, 1, K) ;
reverse (a, 1, n) ;
Implementation III:
reverser(a, 1, K);
reverse(a, K+1, n) ;
reverse (a, 1, n) ;

Q. In quick sort, for sorting n elements , the (n/4)

^{t h}

smallest element is selected as pivot using an 0( n) time algorithm. What is the worst case time complexity of the quick sort?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Evaluation of Determinants

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Evaluation of a Determinant

Standard XII Mathematics

Join BYJU'S Learning Program

CrossIcon