retagged by
10,619 views

3 Answers

5 votes
5 votes
Binary search is always for sorted array , and it takes A) O(log n) time for searching an element
Answer:

Related questions

13 votes
13 votes
3 answers
1
go_editor asked Jun 10, 2016
5,098 views
Djikstra’s algorithm is used toCreate LSAsFlood an internet with informationCalculate the routing tablesCreate a link state database
6 votes
6 votes
2 answers
2
go_editor asked Jun 10, 2016
4,429 views
A rule in a limited entry decision table is arow of the table consisting of condition entriesrow of the table consisting of action entriescolumn of the table consisting o...
7 votes
7 votes
2 answers
3
go_editor asked Jun 10, 2016
2,174 views
The average case and worst case complexities for Merge sort algorithm are$O \: (n^2), O\: (n^2)$$O \: (n^2), O\: (n \log_2 n)$$ O\: (n \log_2 n), O \: (n^2)$$ O\: (n \lo...
6 votes
6 votes
3 answers
4
go_editor asked Jun 10, 2016
6,490 views
Selection sort algorithm design technique is an example ofGreedy methodDivide-and-conquerDynamic ProgrammingBacktracking