The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
302 views

Since Heapify is a recursive function, its space complexity is $O(logn)$ because of the stack space required for recursion.
I also read that space complexity of heapsort is $O(1)$ beause of the explanation here - https://gateoverflow.in/79909/space-complexity-of-heap-sort .

So my question is why the space complexity of Build Heap is $O(logn)$ ?

If space complexity of build heap is $O(logn)$ then heapsorts complexity should also be the same . What am I missing here ?

asked in Algorithms by (81 points)
edited by | 302 views

1 Answer

0 votes
Heapify function can be implemented in recursive as well as iterative way, so if we implement heapify function in iterative way I think space complexity will be O(1)
answered by Active (1.8k points)

Related questions

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
49,783 questions
54,511 answers
188,329 comments
75,109 users