Added object oriented approach for BST. Please review and let me know if any changes are required.

None of the text on the About page is internationalized so that it can be translated into languages other than English.

The individual HTML elements should be given unique ids which can be used with the $.i18n() calls to set the text for the element based on the user's current language. The license text and copyright statement should *not be translated.

These elements should be translate

• Adding hints and doctest to old codes
• Reviewing Pending PRs
• Helping new Contributors
• Add more algorithms #14 #195

thank you

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.

Hi, I'm not sure if more platforms are interesting to you, but I've made a slightly more complete implementation of padding a struct to the cache line size here:

https://github.com/tinco/cache_line_size

I got the information on the cache line sizes from the Go compiler repository, so I'm pretty sure these are correct for all platforms Go runs on, which is a whole bunch.