描述

steps to reproduce

Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

技术栈: csharp
领域: dataperformance
议题类型: bug
难度: 3
预计时间: 1-3 hours
活动状态: stale
清晰度: mostly clear
前置要求: C# basicsunderstanding of heap data structure
新手友好度: 40
研究方向: Examine the MaxHeap implementation in the repository (likely in DataStructures/Heaps/MaxHeap.cs). Compare its insert and extract operations with a standard O(log n) binary heap. The inefficient algorithm might be using linear scans (e.g., for finding parent/child indices or for rebalancing). Check for unnecessary loops or recursive calls that cause O(n) complexity. Look at the linked BinaryHeap from Algorithmia for reference.