There are some interesting algorithms in simulation from Physics, Chemistry, and Engineering especially regarding Monte Carlo simulation: Heat Bath algorithm, Metro-Police algorithm, Markov Chain Monte Carlo, etc.

This is a(n):

• New algorithm
• Update to an existing algorithm
• Error
• Proposal to the Repository

Details:

We can make a file may be READ.

When a binary heap is created from a primitive array of values, we heapify the array to create a binary heap in O(n). However, when a collection is passed into the constructor, we lazily add elements to the PQ resulting in O(nlog(n)) construction. Let's investigate if we can also heapify the collection constructor.

O(n) construction with heapify:
https://github.com/williamfiset/Algorithms/blob

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.