binary search space complexity

Aditya Bahuguna asked Jan 7, 2018 • retagged Jul 17, 2022 by makhdoom ghaya

2,511 views

1 votes

Algorithms
binary-search
recursion
space-complexity
test-series

+ –

Aditya Bahuguna asked Jan 7, 2018 • retagged Jul 17, 2022 by makhdoom ghaya

Aditya Bahuguna

2.5k views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

Ans = C option.

O(logn) because in worst case the height of recursive tree is logn levels!

iarnav answered Mar 2, 2018

iarnav

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

1 answer

A_i_$_h asked Jul 24, 2017

415 views

algorithm
A binary search algorithm is implemented using recurrsion then what is the space and time complexity?

A binary search algorithm is implemented using recurrsionthen what is the space and time complexity?

A_i_$_h

415 views

A_i_$_h asked Jul 24, 2017

Algorithms
binary-search
recursion
space-complexity
time-complexity

+ –

0 votes

2 answers

$ourav asked May 20, 2016

913 views

Time & Space Complexity
Consider the following pseudo code written in C style: bool fun(int arr[],int n,int X) { if(X == 0) return true; if(n == 0 && X !=0) return false; if(arr[n-1]*arr[n-1] > X) return fun(arr, n-1, X); return fun(arr,n-1,X) || ... Time complexity of fun() is O(n2) and it requires O(n) extra space (d) Time complexity of fun() is O(n2) and it requires O(n2) extra space

Consider the following pseudo code written in C style:bool fun(int arr[],int n,int X) { if(X == 0) return true; if(n == 0 && X !=0) return false; if(arr[n-1]*arr[n-1] X)...

$ourav

913 views

$ourav asked May 20, 2016

Algorithms
recursion
time-complexity
space-complexity
geeksforgeeks-test-series

+ –

4 votes

1 answer

KISHALAY DAS asked Oct 19, 2016

933 views

Space Complexity of sorting

KISHALAY DAS

933 views

KISHALAY DAS asked Oct 19, 2016

Algorithms
space-complexity
algorithms
test-series

+ –

1 votes

1 answer

sushmita asked Feb 2, 2017

1,983 views

Time complexity to compute the sum of k smallest element in the binary search tree??
Time complexity to compute the sum of k smallest element in the binary search tree?? can we do it like this- Start doing the inorder traversal of the binary search tree, it will give the elements in increasing order. ... which we have got. Its time complexity will be O(h+k). Am i right?? plzz plzz explain someone

Time complexity to compute the sum of k smallest element in the binary search tree??can we do it like this-Start doing the inorder traversal of the binary search tree, it...

sushmita

2.0k views

sushmita asked Feb 2, 2017

Programming in C
binary-search
binary-search-tree

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Ans = C option.

O(logn) because in worst case the height of recursive tree is logn levels!

0 reply

Please log in or register to add a comment.

Related questions

0

0