Bablzz

def fib_rec (number)
	if number == 0
		return number
	elsif (number == 1) || (number == 2)
		return 1
	end
	fib_rec(number - 1) + fib_rec(number - 2)
end

def fib_non_rec (number)

Bablzz

=begin
O(n + k)
=end

def countSort arr

  countArr = []
  resultArr = Array.new(arr.length)
  max = arr.max

Bablzz

package main
// worst n^2
// best n
import (
  "fmt"
)

func main() {
arr := []int{2,5,4,-8,9,1}

Bablzz

/*
best time O(n log2 n)
worst time O(n log2 n)
*/

package main

import (
	"fmt"
)

Bablzz

package main

import "fmt"

var mes = "test cypeher with digit 6"

func main() {
	bs := ([]byte)(mes)
	cyp := make([]byte, len(bs))
	j := 0

Bablzz

package main

import (
	"fmt"
	"math"
)

func main() {
	a := 32
	b := -44

Bablzz

digit = 543210

# Reverse digit
def reverse_digit(digit)
	str = digit.to_s.reverse.split('')
	if str.first == '0'
		str.shift
	end
	str.join('').to_i
end

Bablzz

years = 5
a = 1000

def bank(a, years)
i = 0
while i != years
	b = (a * 0.1) + a
	a = b
	i += 1
end

Bablzz

def is_simple(digit):
    for i in range(2, digit - 1):
        if ((digit % i) == 0):
              return False
        else:
            return True


print(is_simple(72)) # False
print(is_simple(73)) # True

Bablzz

# O(n log(log n))

arr = list(range(0, 300))


def sieve(ar):
    for i in ar:
        if i > 1:
            step = arr[i]
            while (arr[i] + step) < len(arr):