dave-maldonado

#!/bin/bash

# bash script to upgrade FreePBX distro
# Dave Maldonado @ TeleVoIPs

FINAL_VER="5.211.65-15" # change and add case to main logic to add new version
DOWNLOAD_URL="http://upgrades.freepbxdistro.org/stable"
DONE="false"

# PROCEDURE: find current version of FreePBX distro

dave-maldonado

;; This is a solution in Racket for the second problem on Project Euler
;; 2013 Dave Maldonado

#lang racket

(define (count i n)
  (if (= i n)
      '()
      (cons i (count (+ i 1) n))))

dave-maldonado

class myStuff implements Runnable{
  
    /* Collatz conjecture problem: Skiena's Programming Challenges textbook:
     * This program accepts two ints representing a range of ints from the robo-judge.
     * For each int in the range it peforms the HOTPO operation to produce a hailstone sequence.
     * outputs (prints) the first and second ints inputted and the largest hailstone sequence.
     * produced from the range
     */  
    public void run(){