claytonjwong

/*
 * Kotlin version of C++ equal_range via lower_bound and upper_bound
 *
 * Gist: https://gist.github.com/claytonjwong/2f9c3b33f8697d77a1d442006d4947d6
 */

fun lowerBound(A: IntArray, target: Int): Int {
    val N = A.size
    var i = 0
    var j = N

claytonjwong

/*

Heap Property:

* MinHeap: For every object x, the key of x is <= the keys of its children
* MaxHeap: For every object x, the key of x is >= the keys of its children

----------------------------------------------------------------------------------------------------

Insert:

claytonjwong

/*
 * Javascript version of C++ equal_range via lower_bound and upper_bound
 *
 * Gist: https://gist.github.com/claytonjwong/53bd1c1489b12eccad176addb8afd8e0
 */

let lowerBound = (A, T) => {
    let N = A.length,
        i = 0,
        j = N;

claytonjwong

2-Dimensional Arrays

How to create and initialize 2D arrays of integers with:

• M rows
• N columns
• X initial value

C

• Designated-Inits

int dp[M][N] = { [0 ... M-1] = { [0 ... N-1] = X } };

claytonjwong

template< typename T >
class Solution
{
    using Vector = vector< T >;
    using Iter = typename Vector::iterator;

    Vector go( Vector&& A )
    {
        auto N{ A.size() };
        if( N < 2 ) return A;

claytonjwong

//
// BUBBLE-SORT
//
// loop-invariant:
//
// the right-most i elements are the largest i elements in A[0:N), 0<=i<N
// sorted in ascending order
//
void bubble_sort1(vector<int>& A){
    bool swapped;