h5law

// Package main provides numerous implementations of functions for calculating
// the nth Fibonacci number - detailing their time and space complexities as
// well as their limitations on how large of n they can actually compute.
// Playground link: https://go.dev/play/p/mW_-C9mRr5u
package main

import (
	"fmt"
	"math"
	"math/big"

h5law

import os

# List of modules to check for no access and limited access
no_access_modules = [
    "rand",
    "std::fs",
    "std::net",
    "std::future",
    "std::process",
    "std::sync",

h5law

// quicksort sorts in place the given slice by first finding
// a correctly placed pivot point and then recursively sorting
// the subarrays left and right of the pivot elements
// go.dev/play run this code: https://go.dev/play/p/9SJRhamZO_Q
func quicksort(array []int) []int {
	if len(array) <= 1 {
		return array
	}
	// Choose the initial cursors as the first and last indexes
	c1 := 0

h5law

package main

import (
	"crypto/aes"
	"crypto/cipher"
	crand "crypto/rand"
	"encoding/base64"
	"encoding/hex"
	"encoding/json"
	"errors"

h5law

package main

import (
	"fmt"
	"log"
	"math/big"
	"os"
	"time"
)

h5law

package main

import (
	"fmt"
	"math"
	"math/big"
	"math/rand"
	"sort"
	"time"
)

h5law

const range = (size, startAt = 0) => {
  return [...Array(size).keys()].map(i => i + startAt);
};

const includedIn = (v, ...arrays) => {
  let arr = [];
  for (let i = 0; i < arrays.length; i++) {
    if (arrays[i].includes(v)) {
      arr.push(arrays[i]);
    }