Skip to content

Instantly share code, notes, and snippets.

### Fibonacci function (wrapper and helper) without loops, recusive, in O(n) complexity
def fibonacci(n):
if n < 0:
raise Exception("negative input", n)
else:
return fibonacci_helper(n, 0, 0, 0)
def fibonacci_helper(n, index, term_1, term_2):
if index == n:
rofi usage:
rofi [-options ...]
Command line only options:
-no-config Do not load configuration, use default values.
-v,-version Print the version number and exit.
-dmenu Start in dmenu mode.
-display [string] X server to contact.
${DISPLAY}
-h,-help This help message.
@Araly
Araly / Program.cs
Created October 12, 2018 17:05
simple tree in c# for A4-IBO4
using System;
using System.Collections.Generic;
namespace adsaTree
{
class MainClass
{
public static void Main(string[] args)
{
NaryTreeNode<int> tree = new NaryTreeNode<int>(5);
costs
equipment
raspberry pi with google tensorflow
36e
16Go SD card
12e
RPI camera
20e ~ 30e
RPI microphone
2.5e ~ 7e