Consider an array contain n distinct elements. In array till ‘i’ location element are in increasing order and after ‘i’ location all elements are in decreasing order. What is the time complexity to find location of ith element?
Which of the following is a disadvantage of linear search?
How many passes of bubble sort are required to sort the following sequence (Pass is counted only when at least one swap is performed in the bubble sort pass)?
12, 15, 17, 11, 14, 13
What is the formula used in quadratic probing?
Given a hash table T with load factor 80 that stores 2000 elements, the number of slots is _________
The average search time of hashing, with linear probing will be less if the load factor:
Find the number of spanning trees for the following graph : _______
Consider a complete graph G with 4 vertices. The number of spanning trees possible for graph G.
Consider the following two claims
I. 3n+1 = O(3n)
II. 43n+1 = O(4n)
Which of the claims is/are incorrect?
What is the time complexity of the following segment?