(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
#!/bin/bash | |
# Bitbucket settings | |
BITBUCKET_USER="" | |
BITBUCKET_ORG="" | |
BITBUCKET_APP_PASSWORD="" | |
# GitHub settings | |
GITHUB_USER="" | |
GITHUB_ORG="" |
/* Merge sort in C */ | |
#include<stdio.h> | |
#include<stdlib.h> | |
// Function to Merge Arrays L and R into A. | |
// lefCount = number of elements in L | |
// rightCount = number of elements in R. | |
void Merge(int *A,int *L,int leftCount,int *R,int rightCount) { | |
int i,j,k; |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
This is a cheat sheet I prepared when testing migrations between MBUnit and NUnit. It only covers the areas we used so it's far from complete. It should give a good head start though.
MBUnit | NUnit |
---|---|
[FixtureSetUp] | [OneTimeSetUp] |
[Row] | [TestCase] |
[Factory] | [TestCaseSource] for test cases, [ValueSource] for individual parameters |
[Column] | [Values] |
[SequentialJoin] | [Sequential] |
[CombinatorialJoin] | [Combinatorial] |