https://github.com/TheAlgorithms/Python/blob/master/data_structures/disjoint_set/disjoint_set.py

def union_set(x, y):
    """
    union two sets.
    set with bigger rank should be parent, so that the
    disjoint set tree will be more flat.
    """
    x, y = find_set(x), find_set(y)
    if x.rank > y.rank:
        y.parent = x
    else:
        x.parent = y
        if x.ra

You may use this guide to make quality contributions at Hacktoberfest 2020: Hacktoberfest 2020 guide

To begin contributing, you shall get a quick overview of how Cosmos is used today. Cosmos is one of the most extensive code database and is used as:

• A datastore for various projects (such as [Quark](https://github.com/OpenGenus/

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.

• Suggestion (@lucblassel )
  In algorithms with variants, like Shell Sort, should have a way to the user select an variant to be visualized.
• How it could be implemented:
  Add a Input Box, like a drop list, in front of algorithm selection box.
• Are you up to do it?
  I @LucasPilla will be working on this, feel free to contribute!