Register
Dark Mode

ME ots 2

in Algorithms
198 views
0 votes
0 votes

how O(logn) ? 

if no such a[i] exist in array then in worst case we have to apply binary search for every element and it will take O(nlogn) so better we can have linear search that would take O(n) as we have to travrset it only once .

 

in Algorithms
by
198 views

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
HeadShot asked in Algorithms Dec 1, 2018
206 views
ME- OTS 2
Better than O(n) exists ?
HeadShot asked in Algorithms Dec 1, 2018
by HeadShot
206 views
0 votes
0 votes
0 answers
3
HeadShot asked in Algorithms Dec 1, 2018
580 views
ME- OTS 4
In worst case, for each "n" we have to check every "n then how O(n) ?
HeadShot asked in Algorithms Dec 1, 2018
by HeadShot
580 views
0 votes
0 votes
0 answers
4
HeadShot asked in Algorithms Dec 1, 2018
335 views
ME - OTS 3
HeadShot asked in Algorithms Dec 1, 2018
by HeadShot
335 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!