@kenbitanga

function* fib(a=0, b=1) { while (true) { yield a ;[a, b] = [b, a + b] } } let fibs = fib() for (let i = 0; i < 10; i++) { console.log(fibs.next().value)

def fib(a=0, b=1): while True: yield a a, b = b, a + b fib = iter(fib(1, 2)) fibs = [next(fib) for i in range(10)] print(fibs)

package main import "fmt" func msort(arg []int) []int { if len(arg) <= 1 { return arg } mid := len(arg) / 2

package main import "fmt" func counter() func() int { n := 0 return func() int { n += 1 return n }

def msort(arr): if len(arr) <= 1: return arr mid = len(arr) // 2 left = msort(arr[:mid]) right = msort(arr[mid:]) return merge(left, right)

using System; using System.Collections.Generic; using System.Linq; namespace MergeSort { public class Sort { public List<int> Msort(List<int> items) {

def merge_sort(arr): if len(arr) <= 1: return arr mid = len(arr) // 2 left_half = arr[:mid] right_half = arr[mid:] return merge(merge_sort(left_half), merge_sort(right_half))

function merge(a, b) { const result = [] let i = 0, j = 0; while (i < a.length && j < b.length) { if (a[i] < b[j]) { result.push(a[i]) i++ } else {

import java.util.*; import java.lang.*; import java.io.*; class Sort { public List<Integer> mSort(List<Integer> items) { if (items.size() < 2) { return items; }

#include <iostream> #include <vector> void print_vec(std::vector<int> vec) { std::cout << "[ "; for (auto i: vec) { std::cout << i << ' '; } std::cout << "]" << '\n'; }

def mergeSort(items): if len(items) < 2: return items a = items[:len(items) // 2] b = items[len(items) // 2:] return merge(mergeSort(a), mergeSort(b)) def merge(a, b): result = [] i, j = 0, 0

def is_prime(n): if n < 2: return False i = 2 while i * i <= n: if n % i == 0: return False i += 1 return True for i in range(30):

def is_prime(n): if n < 2: return False for i in range(2, int(n ** 0.5) + 1): if n % i == 0: return False return True for i in range(30): if is_prime(i): print(i)

def merge(l, r) case [l, r] in [_, []]; l in [[], _]; r in [[x, *xs], [y, *ys]] return [x, *merge(xs, r)] if x <= y [y, *merge(l, ys)] end end

def merge(l, r) return l if r.empty? return r if l.empty? x, *xs = l y, *ys = r return [x, *merge(xs, r)] if x <= y [y, *merge(l, ys)] end def msort(li)

def partition(f, li): match li: case []: return [], [] case [x, *xs]: ys, zs = partition(f, xs) if f(x): return [x, *ys], zs return ys, [x, *zs] def qsort(li):

def partition(f, li): if not len(li): return [],[] x, *xs = li ys, zs = partition(f, xs) if f(x): return [x, *ys], zs return ys, [x, *zs] def qsort(li): if not len(li):

from functools import cache import time @cache def fib_c(n): if n <= 1: return n return fib_c(n-1) + fib_c(n-2) def fib_n(n): if n <= 1: return n

def msort(li): match li: case []: return [] case [x]: return [x] case xs: ys, zs = halve(xs) return merge(msort(ys), msort(zs)) def halve(xs): ys = xs[:len(xs) // 2]

def isPanagram(text): if len(text) < 26: return False alphabet = [chr(i+97) for i in range(26)] textlow = text.lower() for i in alphabet: if i not in textlow: return False return True text = ''.join([chr(i+97) for i in range(26)])