dillmo

/* Introduction to C++ Homework Problem Set 5 Project by Dillon Morse
 * ------------------------------------------------------------------
 * Create a sequential file that contains 34 rows and 34 columns. Fill the
 * array with random numbers between -20 and 80. Your main code will ask the
 * user to enter a number N between -20 and 80. Yoiu will open the file and
 * search the two dimension array you read in for the number N. If found,
 * display the number of times it was found. Next, pass your two dimension
 * array to a functoin called diagonal. The function will ask the user if they
 * want the sum of the main diagonal values to a function called diagonal. The
 * function will ask the user if they want the sum of the main diagonal values

dillmo

#include <iostream>
#include <regex>
#include <cstdlib>

using namespace std;

double* getInput();
bool undefined(double*);
double a(double*);
double c(double*, double);

dillmo

/* Introduction to C++ Project 2 by Dillon Morse
 * =============================================
 *
 * Description
 * -----------
 * Spec out how you will code and test the definition and use of a right
 * triangle class.
 * 1. Determine what your data will be.
 * 2. Create prototypes of the following functions:
 *   - Constructor(s)

dillmo

BANG !!!
AND THEY'RE OFF !!!!!

H==T=================================================================
T = Tortoise
H = Hare
B = Both

=H==T================================================================
T = Tortoise

dillmo

<?xml version="1.0" ?>
<enemy>
    <behaviour>
        <root x="110" y="40">
            <normal>
                <andblock>
                    <string id="Comment">Avoid Earthquake</string>
                    <normal>
                        <condition id="isOnGround">
                            <string id="condition" values="yesno">yes</string>

dillmo

def soundex(name):
    code = {
        'b': '1',
        'f': '1',
        'p': '1',
        'v': '1',
        'c': '2',
        'g': '2',
        'j': '2',
        'k': '2',

dillmo

#include <stdlib.h>
#include <stdio.h>

struct node {
    struct node *parent;
    struct node *left;
    struct node *right;
    int value;
    int weight;
};

dillmo

method FastExp(a: int, n: nat) returns (z: int)
  ensures z == Exp(a, n)
{
  var b: int, i: nat;
  z, b, i := 1, a, n;
  while (i != 0)
    invariant ExpInv(z, b, i, a, n)
    decreases i
  {
    if i % 2 == 1 {