Register

Zeal Test Series 2019: Algorithms - Time Complexity

• edited by
387 views
1 votes
1 votes

 A sorted array of n elements which has been circularly shifted. For example, {18,25,1,5,11,16} is a sorted array that has been circularly shifted by 2 positions. suppose a person has to find the largest element in a circularly shifted array. Here, there is a small constraint that the number of positions through which it has been shifted is unknown. find time complexity.  

1.

O(nlogn)

 

2.

O(n)

 

3.

O(n^2)

 

4. 

O(logn)
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Prince Sindhiya asked Jan 2, 2019
867 views
Zeal Test Series 2019: Algorithms - Graph Algorithms
If the DFS finishing time f[u] < f[v] for two vertices u and v in a directed graph G, and u and v are in the same DFS tree in the DFS forest, then u is an ancestor of v in the depth first tree ? True /False can anyone explain it ?
If the DFS finishing time f[u] < f[v] for two vertices u and v in a directed graph G, and u and v are in the same DFS tree in the DFS forest, then u is an ancestor of v i...
User Avatar
0 votes
0 votes
1 answer
4
Prince Sindhiya asked Jan 2, 2019
583 views
Zeal Test Series 2019: Databases - Er Diagram
Match the following: (a) Create (i) The E-R Model (b) Select (ii) Relationship Model (c) Rectangle (iii) DDL (d) Record (iv) DML in answer a is matched with dml but what i know ---select is for data retrival and insert update delete are for DML
Match the following:(a) Create (i) The E-R Model(b) Select (ii) Relationship Model(c) Rectangle (iii) DDL(d) Record (iv) DMLin answer a is matched w...
User Avatar
Link Copied!