我使用heapsort对整数进行分类。
我想知道4个阵列长度的元素比较数量。
现在，当我使用全局变量时，对于最坏情况，它会计算6。好吧，我认为Heapsorts最差的表现是NLOG2（n）。所以应该是8对吗？
因此，当我去并插入我的数组，它也说6。
到目前为止，谢谢
i use HeapSort to sort an array of integers.
And i want to know the number of element comparisons for an arraylength of 4.
Now when i use a global variable it counts 6 for the worstcase. Well i thought HeapSorts worst-case performance is nlog2(n). So it should be 8 right?
So when i go to http://www.allisons.org/ll/AlgDS/Sort/Heap/ and insert my array, it also says 6. But what does this faktor of * 0,75 do in this case?
Thanks so far
发布评论