Skip to content

Instantly share code, notes, and snippets.

View gozzoo's full-sized avatar

Evgeni Milev gozzoo

  • Smartmedia
  • Sofia, Bulgaria
View GitHub Profile
@gozzoo
gozzoo / fannkuch-redux.go
Created August 10, 2011 09:30
fannkuch-redux Go program source code
package main
import (
"fmt"
"os"
"strconv"
)
func max(a, b int ) int {
if a > b {
@gozzoo
gozzoo / fannkuchredux.dart
Created July 5, 2012 07:20
fannkuchredux benchmark implementation in dart
#import('dart:core');
class FannkuchreduxTest {
static int fannkuchredux(int n) {
var perm = new List(n);
var perm1 = new List(n);
var count = new List(n);
int maxFlipsCount = 0;
int permCount = 0;
@gozzoo
gozzoo / Fannkuchredux.java
Last active October 6, 2015 20:58
fannkuchredux benchmark implementation in java
public class Fannkuchredux {
static int fannkuchredux(int n) {
int[] perm = new int[n];
int[] perm1 = new int[n];
int[] count = new int[n];
int maxFlipsCount = 0;
int permCount = 0;
int checksum = 0;
int i;
@gozzoo
gozzoo / fannkuchredux.js
Created July 5, 2012 07:47
annkuchredux benchmark implementation in javascript
function fannkuchredux(n) {
var perm = new Array(n);
var perm1 = new Array(n);
var count = new Array(n);
var maxFlipsCount = 0;
var permCount = 0;
var checksum = 0;
var i;
for (i = 0; i < n; i++)
import os, strutils
proc max(a, b: int): int =
if a > b:
return a
return b
proc fannkuchredux(n: int): int =
var perm = newSeq[int](n)
var perm1 = newSeq[int](n)
на github
1. изтриване на проетка
2. създавене на private проект със същото име
3. добавяне на gozzoo като colraborator
4. копираш урл-а; _git_project_url_
локално
1. изтриване на директорията .git
  1. PID1, PID2 да са работят независимо един от друг

  2. watchdog

  3. записване на настройките на PID в EEPROM

  4. тест с трети датчик на темпратура. логика за управление

  5. preinfusion прост вариант - изключване на помпата

@gozzoo
gozzoo / binary-search.swift
Last active December 17, 2020 10:09
swift problems
func find(_ arr: [Int],_ num: Int) -> Bool {
var leftS = 0 , rightS = arr.count - 1
while leftS <= rightS {
var mid = (leftS + rightS) / 2
if arr[mid] == num {
return true
} else if arr[mid] < num {
leftS = mid + 1
} else {
rightS = mid - 1
class BitSet {
func getElements() -> [Int] {
var res = [Int]()
var sIdx = -1
var mask:UInt64 = 1
for var i in 0...size {
var bitPos = i % 64
if bitPos == 0 {
sIdx += 1
mask = 1