krestovolt

# toolchain/BUILD.bazel

package(default_visibility = ["//visibility:public"])

cc_toolchain_suite(
    name = "cc_linux_cross_64_suite",
    toolchains = {
        "x86_64": ":linux_cross_toolchain_64",
        "x86_64|gcc-cross": ":linux_cross_toolchain_64",
    },

krestovolt

/*
An attempt to implement bottom-up (iterative) merge sort
using reusable auxiliary array for the merging step.

ref: https://www.interviewbit.com/tutorial/merge-sort-algorithm/
*/

#include <iostream>

using std::cout;

krestovolt

#include <iostream>
#include <utility>
#include <vector>
#define ll long long
using namespace std;

template <typename T> class Point
{
public:
    T x;

krestovolt

#include <stdio.h>

#define BIT_SHIFTCNT   (5)
#define BIT_CNT        (1 << BIT_SHIFTCNT)
#define BIT_MASK       (BIT_CNT - 1)

// This code implementation is for learning purpose
// on how to perform bit masking with any bit length,
// and for snippet.
// Use at your own risk.