Problem Here is my merge sort c++ implementation. Looking for code improvement and optimization opinion. Just one question which is […]
Tag: c++14
Subset Component Task
Problem I’ve solved a problem Subset Component Problem You are given an array with n 64-bit integers: d[0],d[1],….,d[n-1]. BIT(x, i) = (x […]
Generic merge sort in C++ using a user-defined comparison function or the < operator by default
Problem I wanted to implement a generic merge sort algorithm using the same interface as std::sort(). The interface takes first […]
Insertion sort C++14 implementation
Problem I have implemented insertion sort using C++. Is there any way to improve my code and is it CppCoreGuideline […]
Generic multi dimension grid / array class in C++
Problem I am writing a generic C++14 multi dimensional array for computational science purpose. The “features” so far for the […]
Contacts programming challenge
Problem I successfully solved a problem on Hackerrank called Contacts, but I’m curious if my code in C++ looks good […]
Counting number of unique elements in a sorted container
Problem Similar to this question, but in C++. Although my priority is performance (and correctness!) rather than readability. #include <algorithm> […]
Check is_permutation on a pair of same sized arrays – follow-up
Problem After considering the suggestions of my previous question, Check whether given a pair of arrays are permutation of each […]
ThorsSQL Lib: Part 3: Layer 1
Problem Have a working version of MySQL implementation of ThorsSQL library done. If you want to check it out you […]
Implementation of the Heap Sort algorithm in C++
Problem I’m writing a little collection of sorting algorithms and some benchmarks (using Google benchmark). I wrote the following heap […]