Mikedgs’s gists

Mikedgs / gist:1484c493b5c3e8958c18

Created August 27, 2014 08:17

Repository

	using System;
	using System.Collections.Generic;
	using System.Linq;
	using System.Linq.Expressions;
	using Mindscape.LightSpeed;
	using Mindscape.LightSpeed.Linq;
	using Mindscape.LightSpeed.Logging;
	using URL_Shorterner.Models;
	using System.Configuration;

Mikedgs / gist:5604dcd0d733346e266a

Created May 23, 2014 00:10

Sentence

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

	namespace TypingGame
	{
	class Sentence
	{

Mikedgs / gist:35aec124c4bbf9ed5ac4

Created May 23, 2014 00:09

SentenceDB

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

	namespace TypingGame
	{
	class SentenceDB

Mikedgs / gist:0d9fd903eabdbc42f508

Created May 20, 2014 07:13

Classes

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

	namespace Employees
	{
	class Nurses : Employees
	{

Mikedgs / rpn.cs

Created May 18, 2014 22:33

RPN with args

	using System;
	using System.Collections;
	using System.Collections.Generic;
	using System.Text.RegularExpressions;

	namespace Phase0_Exercise31_Reverse_Polish_Notation_Calculator
	{
	public class RPNCalculator
	{
	public static void Main(string[] args)

Mikedgs / gist:6e262e2bd7c8efe76e5c

Created May 14, 2014 05:12

stack.cs

Mikedgs / jquery_example.html

Last active August 29, 2015 14:00 — forked from dbc-challenges/jquery_example.html

Intro to jQuery for Phase 0

	<!DOCTYPE html>
	<html>
	<head>
	<title>DOM manipulation with jQuery</title>

	<!-- Add a link to jQuery CDN here script here -->
	<script src="https://ajax.googleapis.com/ajax/libs/jquery/1.10.2/jquery.min.js"></script>
	<script type="text/javascript" src="jquery_example.js"></script>
	</head>
	<body>

Mikedgs / gist:9562197

Created March 15, 2014 05:24

Exercise 33: Fibonacci Numbers

	// A fibonacci number can is one that fits the sequence F(n) = F(n-1) + F(n-2)
	// I think the easiest way to determine if a number fits this sequence is the generate the entire sequence
	// up to the number in question, and if that number is generated it is a Fibonacci number

	// 1 :generate starting numbers 0 and 1
	// 2: start counting sequence by adding them together than assigning new numbers
	// 3: stop counting sequence and determine if the given number fits


	// INITIAL CODE: