The UI of the scatterplot has got more ugly between 3.4 and the current development version.

To Reproduce

Steps to reproduce the behavior: create any scatterplot facet.

Current Results (master)

Expected Behavior (3.4)

![image](https://user-images.githubuserconten

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

thank you

The annual Hacktoberfest is around the corner! Register on Hacktoberfest's website and open 4 pull requests during October 2020 to receive the swags (if you're the first 70,000 participants)!

In our C repository, there are currently several open issues:

What's more, you can also **fix an existing bugs, impr

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.

As of now, companies articles are aligned in the form of bulleted unordered list. But the problem with this approach is that as soon as we have properly completed articles of more companies, it will turn into a big mess.
Have seen alphabetical grid approach in multiple awesome prefixed repos. If the same can be implemented here, then it will look well ordered and presented.