Blog

Your dream job? Lets Git IT.
Interactive technical interview preparation platform designed for modern developers.

XGitHub

Platform

  • Categories

Resources

  • Blog
  • About the app
  • FAQ
  • Feedback

Legal

  • Privacy Policy
  • Terms of Service

© 2025 LetsGit.IT. All rights reserved.

LetsGit.IT/Categories/Algorithms
Algorithmsmedium

Heap sort: what are its time complexity, space complexity, and stability?

Tags
#heapsort#sorting#complexity#stability
Back to categoryPractice quiz

Answer

Heapsort runs in O(n log n) time, uses O(1) extra space (in‑place), and is not stable (equal elements can change order).

Related questions

Algorithms
Bitmask DP (subset DP): what is it and what is a typical complexity?
#dp#bitmask#subset
Algorithms
Sliding window: what is it and when is it better than nested loops?
#sliding-window#two-pointers#complexity
Algorithms
Counting sort: when can it be faster than O(n log n) sorting?
#counting-sort#sorting#stability
Algorithms
What does amortized O(1) mean? Explain with dynamic array growth.
#amortized#complexity#dynamic-array
Algorithms
What does it mean that a sort is stable, and why does it matter?
#sorting#stable-sort#algorithm
Algorithms
What does Big-O describe?
#big-o#complexity#performance