int min1(int [] arr, int first, int last)
{
	int m, i;
	m = arr[first];
	
	for (i = first + 1; i <= last; i++) {
		if (arr[i] < m) {
			m = arr[i];
		}
	}
	
	return m;
}
int min2(int [] arr, int first, int last)
{
	int m;
	
	if (first == last) {
		return arr[first];
	}
	
	m = min2(arr, first + 1, last);
	if (arr[first] < m) {
		return arr[first];
	}
	
	return m;
}

user code
331  Give me your password, please
Pass guru
230  Logged in successfully
TYPE I
200  Type is Image (Binary)
port 220,5,211,3,5,42
200  PORT command okay
RETR codeguru

 Volume in drive C is Codeguru
 Volume Serial Number is C001-C0DE
 Directory of C:
File Not Found

MOV DX, 0F8FAH
MOV CX, 1
MOV BX, 1EA0H
MOV AX, 0B8B8H
INC AX
INC AX

not dx
not cx
not bx
neg ax
sbb bx, FFFFH
sbb cx, FFFFH
sbb dx, FFFFH

public boolean getBoolean() {
	try {
		return true;
	} finally {
		return false;
	}
}

char *c();

MOV AX, 0xF00D
PUSH AX
PUSH SP
MOV AX, SP
POP SP
PUSH AX
MOV CX, _____
GetOverHere:
POP SP
LOOP GetOverHere

delegate void functions();
static void f1() {
	Console.WriteLine("1");
}
static void f2() {
	Console.WriteLine("2");
}
static void Main(string args[]) {
	functions fs=new functions(f1);
	
	fs+=f2;
	fs();
}

INSERT INTO Person (TeudatZehut, Name) VALUES (12345678, ג€˜Arikג€™);
INSERT INTO Car (OwnerTeudatZehut, CarNumber) VALUES (12345678, 2388841);

int *x=new int[100];
int *p=x;
*p++=*p++=1;
for (int i=2; i<100; p++){
	*p=p[-1]+p[-2];
}

for (i=0; i<10; i++);
    putchar('-');

class A {
public:
	A() {};
	A(const A& a) {cout<<"in copy cons"<<endl; }
	A(const A* a) {cout<<"in simple function"<<endl; }
};
void main() {
	A a;
	A b(&a);
}

srand(time(NULL));
a=250;
cnt=0;
for (int i=0 ; i<31337 ; i++){
	int n=(rand()%(a*2))-a;
	int m=(rand()%(a*2))-a;
	if (n*n+m*m<=a*a){
		cnt++;
	}
}

The system has detected an IP address conflict with another system on the network.
Network operations on this system may be disrupted as a result. 
More details are available in the system event log. 
Consult your network administrator immediately to resolve the conflict.

int f(int x) return x^(x>>1);