Geek Answers Handbook

What is the difference between a heap and a losing tree in external sorting?

I felt that they were very similar to each other, with the exception of some concepts. With external sorting, their functions are basically the same, that is, find the minimum / maximum value in k runs. So, are there two significant differences between them?

+8
language-agnostic sorting
source share

No one has answered this question yet.

See related questions:

3835
How to effectively combine socks with a bunch?
1642
What is the difference between a method and a function?
950
What is the difference between concurrency and concurrency?
870
Fast beta: sorting arrays
754
What is the difference between deep copy and shallow copy?
552
What is the difference between argument and parameter?
469
What is the difference between passing by reference or passing by value?
383
Fastest fixed length type 6 int array
78
Hash code and checksum - what's the difference?
71
The difference between red-black trees and AVL trees

More articles:


All Articles