vlad-bezden

let rec TowerOfHanoi fromPole destPole tempPole disks =
    if disks > 0 then
        TowerOfHanoi fromPole tempPole destPole (disks - 1)
        printfn "Moving from %c to %c" fromPole destPole
        TowerOfHanoi tempPole destPole fromPole (disks - 1)
        
TowerOfHanoi '1' '2' '3' '4'

vlad-bezden

let rec factorial n = 
    match n with
    | 0 | 1 -> 1
    | _ -> n * factorial(n - 1)

vlad-bezden

let factorial n = 
    [1..n] |> List.reduce (*)

vlad-bezden

let rec fibonacci n =
    match n with
    | 1 | 2 -> 1
    | _ -> fibonacci (n - 1) + fibonacci (n - 2)

vlad-bezden

public int GCD(int first, int second)
{
	return second == 0
		? first
		: GCD (second, first % second);
}

vlad-bezden

private BufferBlock<int> queue = new BufferBlock<int>();

void Main()
{
	var producers = Enumerable.Range(0, 10).Select(async x =>
	{
		await Producer();
	});
	
	var consumer = Consumer();

vlad-bezden

private readonly BlockingCollection<int>  _blockingQueue = new BlockingCollection<int>();

void Main()
{
	var producer = Producer();
	var consumer = Consumer();
	
	Task.WaitAll(producer, consumer);
	
	Console.WriteLine("Done");

vlad-bezden

public int FirstDivisor(int number)
{
	return Enumerable.Range(2, (int)Math.Sqrt(number)).FirstOrDefault(x => number % x == 0);
}

vlad-bezden

String.prototype.times = function(count) {
    return count < 1 ? '' : new Array(count + 1).join(this);
};

vlad-bezden

public bool IsPrime(int number)
{
	return !Enumerable.Range(2, (int)Math.Sqrt(number) - 1).Any(x => number % x == 0);
}