hfadev

//find number of inversions in a list
//inversion: number of (i,j) pairs where a[i] > a[j] and i < j

int merge(int* a, int n);
int countInversion(int* a, int n);

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

hfadev

void merge(int* a, int n);
void mergeSort(int* a, int n);

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

#define NUM_ELEMENTS_IN(t) (sizeof(t)/sizeof(*t))

int main(int argc, char const *argv[])

hfadev

void swap(int *a,int*b){
	int t = *a;
	*a = *b;
	*b = t;
}
void selectionSort(int* a,int n){
	int min;
	int i,k;
	
	for (i = 0; i < n-1; ++i)

hfadev

printf("hello world");

hfadev

//random number generation
srand(time(NULL));
printf("%d\n", rand());

hfadev

#define MAX(a,b) ((a) > (b) ? ( a ) : ( b )) 

hfadev

//copy n integer
//string.h
memcpy(dest,from,sizeof(int)*n);

//memory management
//stdlib.h
void f(){
	int* numberList = (int*) malloc(sizeof(int) * 1000);
	numberList = (int*)realloc(numberList,100);

hfadev

{
    "cmd": ["perl", "-w", "$file"],
    "file_regex": ".* at (.*) line ([0-9]*)",
    "selector": "source.perl"
}

hfadev

//----Functions----

//arguments usage
function min(){
    var min = Number.POSITIVE_INFINITY;
    for( var i = 0; i < arguments.length; i++){
        if( arguments[i] < min ){
            min = arguments[i];
        }
    }