ArnonEilat

#include <stdio.h>
#include <stdlib.h>
 
#define FALSE  0
#define TRUE  1
 
typedef struct {
    int info;
} DATA;
 

ArnonEilat

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

typedef struct {
    int info;
} DATA;

typedef struct node {
    DATA data;
    struct node* next;

ArnonEilat

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

typedef struct {
    int info;
} DATA;

typedef struct node {
    DATA data;
    struct node *next;

ArnonEilat

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

typedef struct {
    int info;
} DATA;

typedef struct node {
    DATA data;
    struct node * prev;

ArnonEilat

#include <stdio.h>
#include <stdlib.h>
#define N 4

void swap(int *a, int *b) {
    int temp;
    temp = *a;
    *a = *b;
    *b = temp;
}

ArnonEilat

#include <stdio.h>
#include <stdlib.h>
#define COLUMNS_NO 3

void sort_column(char matrix[][COLUMNS_NO], int lines_no, int col) {
    int i, j;
    char temp;

    for (i = 0; i < lines_no - 1; i++) {
        for (j = 0; j < lines_no - 1 - i; j++) {

ArnonEilat

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

#define TRUE  1
#define FALSE	0

/* a link in the queue, holds the info and point to the next Node*/
typedef struct {
    int info;
} DATA;

ArnonEilat

#include "BinarySearchTree.h"

/*! \fn Tree * add(Tree *nod , int number)
 *  \param *nod pointer to <tt>Tree</tt> struct.
 *  \param number a <tt>int</tt> to add.
 *  \return pointer to <tt>Tree</tt> struct.
 */
Tree * add(Tree* nod, int number) {
    if (nod == NULL) {
        nod = (Tree*) malloc(sizeof (Tree));

ArnonEilat

Array.prototype.insert = function(index, item) {
  this.splice(index, 0, item);
};


/***
 * var swapTest=['a','b','c'];
 * swapTest.swap('a','c')
 * @param {type} first
 * @param {type} second

ArnonEilat

!function() {
  var d3 = {
    version: "3.4.5"
  };
  if (!Date.now) Date.now = function() {
    return +new Date();
  };
  var d3_arraySlice = [].slice, d3_array = function(list) {
    return d3_arraySlice.call(list);
  };