MichaelEstes

//Michael Estes
//Conway's Game of Life C++

#include <iostream>
#include <fstream>

using namespace std;

void enterBoard(char firstBoard[][45], int& rows, int& columns);
void fileBoard(char firstBoard[][45], int &rows, int &columns);

MichaelEstes

//Michael Estes 
//Connect 4 Console C++
#include <iostream>
using namespace std;

struct playerInfo
{
	char playerName[81];
	char playerID;
};

MichaelEstes

//Michael Estes
//Connect 4 Command Line C#

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

public struct playerInfo

MichaelEstes

import pygame, random, sys
pygame.init()
global screen, size, background, state, mainState, jumpState
mainState = 0
jumpState = 1
slideState = 2
size = [800, 600]
black = 0, 0, 0
white = 255, 255, 255
screen = pygame.display.set_mode(size)

MichaelEstes

bool CheckCollisionShapeCircle(sf::Shape & shape, sf::CircleShape circle){

	sf::Vector2f shapePoint, shapePosition, circleCenter;
	float radius;
	sf::FloatRect shapeBounds = shape.getLocalBounds();
	int numPoints = shape.getPointCount();

	shapePosition = shape.getPosition();
	circleCenter = circle.getPosition();
	radius = circle.getRadius();

MichaelEstes

//Start of Vectors.h file

#include <cmath>


#ifndef FLYNNVECTOR_H
#define FLYNNVECTOR_H

#define pi 3.14159

MichaelEstes

#include "vector.h"
#include "circle.h"

using namespace std;


#ifndef RECTANGLE_H
#define RECTANGLE_H

class Rectangle2D{

MichaelEstes

#include "vector.h"


class Ray2D{
public:
	gVector2 origin, direction, pointOnRay;
	float length;
	rayType type;
	Ray2D() : origin(0, 0), direction(0, 0), length(0){};
	Ray2D(gVector2 o, gVector2 d, float l = 0) : origin(o), direction(d), length(l){

MichaelEstes

node duplicateList(node* list)
	{
		node *currentNode = list, *newNode = nullptr, *tempNode = nullptr;
		while (currentNode)
		{
			tempNode = new node;
			tempNode->tag = currentNode->tag;
			tempNode->next = currentNode->next;
			tempNode->random = currentNode->random;
			currentNode = currentNode->next->next;

MichaelEstes

#include <iostream>

using namespace std;

const int array_length = 2048;

struct Q{
	int first;
	int last;
	unsigned char data[array_length];