@kenbitanga

class A: def __init__(self, name, age): self.name = name self.age = age a = A('jake', 22) print(a.name, a.age) from collections import namedtuple B = namedtuple('Record', 'name, age')

from collections import namedtuple Person = namedtuple('Person', ['name', 'age']) jake = Person('jake', 22) print(jake) print(jake.name, jake.age)

def fib(start=0): a, b = start, start+1 yield a while True: yield b a, b = b, a+b for i in fib(): if i > 100: break print(-i, end=" ")

def fib(n, start=0): res = [] a, b = start, start+1 res.append(a) for i in range(n-1): res.append(b) a, b = b, a+b return res print(fib(5))

def fib(start=0): a, b = start, start+1 yield a while True: yield b a, b = b, a+b for i in fib(): if i > 100: break print(i, end=" ")

def fib(n, start=0): a, b = start, start+1 yield a for i in range(n-1): yield b a, b = b, a+b print(list(fib(5)))

package main import "fmt" func swap(arr []int, a, b int) { temp := arr[a] arr[a] = arr[b] arr[b] = temp } func bubbleSort(arr []int) {

def bubsort(arr): for j in range(len(arr)): for i in range(len(arr)-1-j): if arr[i] > arr[i+1]: arr[i], arr[i+1] = arr[i+1], arr[i] arr = [2,4,1,5,3] print(arr) bubsort(arr) print(arr)

function bubsort(arr) { for (let i = 0; i < arr.length; i++) { for (let j = 0; j < arr.length-1-i; j++) { if (arr[j] > arr[j+1]) { [arr[j], arr[j+1]] = [arr[j+1], arr[j]] } } } }

package main import "fmt" // struct type Contact struct { name string age int } // function func Update(c *Contact, name string, age int) {

<?php function memoize($func) { $memo = []; return function($n) use ($func, $memo) { if (array_key_exists($n, $memo)) { return $memo[$n]; } $memo[$n] = $func($n); return $memo[$n];

package main import "fmt" func memoize(fn func(int) int) func(int) int { var memo = make(map[int]int) return func(n int) int { if _, ok := memo[n]; !ok { memo[n] = fn(n) }

fib = lambda do |n| if n < 1 return 0 elsif n < 2 return 1 else return fib.call(n-1) + fib.call(n-2) end end

function fib(n) { if (n <= 2) { return 1; } return fib(n - 1) + fib(n - 2); } function memoize(func) { memo = {}; return function(n) {

def memoize(func): memo = {} def wrapper(n): if n in memo: return memo[n] memo[n] = func(n) return memo[n] return wrapper @memoize

fun hanoi(disks: Int, src: String, dest: String, aux: String) { if (disks > 0) { hanoi(disks - 1, src, aux, dest) println("Move disk from $src to $dest") hanoi(disks - 1, aux, dest, src) } } fun main() { var disks

#include <iostream> void hanoi(int disks, std::string src, std::string dest, std::string aux) { if (disks > 0) { hanoi(disks - 1, src, aux, dest); std::cout << "Move disk from " << src << " to " << dest << '\n'; hanoi(di

package main import "fmt" func hanoi(disks int, src string, dest string, aux string) { if (disks > 0) { hanoi(disks - 1, src, aux, dest) fmt.Println("Move disk from", src, "to", dest) hanoi(disks - 1, aux, dest, src)

function hanoi(disks, src, dest, aux) { if (disks > 0) { hanoi(disks - 1, src, aux, dest); console.log(`Move disk ${disks} : ${src} -> ${dest}`); hanoi(disks - 1, aux, dest, src); } } disks = 3; console.log(`Using ${

def hanoi(disks, src, dest, temp): if disks > 0: hanoi(disks - 1, src, temp, dest) print(f'move disk from {src} to {dest}') hanoi(disks - 1, temp, dest, src) for i in range(4): print(f'using {i} {"disk" if i == 0 els