File:SequenceHeapInsert.gif
Summary
| Description |
English: k=2, m=2
1. Insert Heap contains (5, 13) and is now full. 2. It is merged with the deletion buffer, the group buffer 1 and sorted resulting in (2, 5, 6, 10, 13). (2) is placed in the deletion buffer, (5, 6) in the group buffer. (10, 13) are place into the first K-Way-Merge and it overflows. 3. The old elements are merged resulting in 11,14,16,18. The new sorted sequence is added to K-Way-Merge 2. 4. Group Buffers 1 and 2 are invalidated and merged into a new sequence (5, 5, 6, 15) in K-Way-Merge 1. (5, 5) is written into Group Buffer 1. 5. Group Buffer 2 is now refilled from the sorted sequences of K-Way-Merge 2. |
| Date | |
| Source | Own work |
| Author | Azubit |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
