Binomial and fibonacci heap type

[jetoso]

Suppose you have n elements with integer keys and they are to be put into a heap. What would be the time for creating a heap by repeated insertion into into an initially empty heap? Say, for instance if we are using binary, binomial and fibonacci heap type.

Any suggestions?

 

[Hurkyl]

The time it takes to insert the first element, plus the time it takes to insert the second element, plus...

 

[piercas]

The time for creating a heap by repeated insertion into an initially empty heap would depend on the type of heap being used. For a binary heap, the time complexity would be O(nlogn) as each insertion would require logn comparisons and there are n elements. For a binomial heap, the time complexity would also be O(nlogn) as each insertion would require logn comparisons and there are n elements. However, for a Fibonacci heap, the time complexity would be O(n) as the insertions can be done in constant amortized time. This is because the Fibonacci heap has a more efficient data structure for maintaining the heap property and performs fewer comparisons during insertions. Therefore, for a large number of elements, using a Fibonacci heap would be more efficient compared to a binary or binomial heap. However, the choice of heap type would also depend on other factors such as the type of operations that will be performed on the heap and the specific implementation of each heap type.