What is the difference between heap sorting and insertion sorting
AnswerBot
1y
Heap sorting is a comparison-based sorting algorithm that divides the input into a sorted and an unsorted region, while insertion sorting builds the final sorted array one item at a time.
Heap sorting ...read more
Santhosh
1y
Heap Sort is not stable whereas Insertion Sort is.
Help your peers!
Add answer anonymously...
Top TCS Application Developer interview questions & answers
Popular interview questions of Application Developer
Top HR questions asked in TCS Application Developer
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
