Help With Tournament Trees
I'm having some trouble with an assignment I was given. I understand the concept of bins and all, but I'm just not sure how to apply it in this situation. Any Suggestions:
Use a tournament tree to generate sorted runs that are greater than the size of memory. Assume that the memory can hold a tournament tree with 4 elements and we have 16 elements to be input in the following order: 10, 5, 13, 9, 16, 2, 8, 14, 1, 7, 11, 3, 4, 15, 6, 12. Show the results of the sorted runs.